Submission #208317

#TimeUsernameProblemLanguageResultExecution timeMemory
208317mohamedsobhi777Schools (IZhO13_school)C++14
5 / 100
365 ms15224 KiB
#include<bits/stdc++.h> using namespace std ; const int N = 1e6 + 7 , mod = 998244353; long long n , A , B; long long a[N] , b[N] ; long long ans ; int gA , gB ; priority_queue<pair< pair<long long , long long > , int > > q1 , q2 ; int main() { //freopen("in.in" , "r" , stdin) ; cin>>n>>A>>B ; for(int i = 0 ; i < n ; i++){ cin>>a[i] >> b[i] ; if(a[i]>=b[i]){ q1.push({ { b[i], b[i] -a[i]},i }); } else { q2.push({{ a[i] , a[i] - b[i] }, i}) ; } ans += max(a[i] , b[i] ) ; } while(q1.size()> A && q2.size() < B){ ans+=q1.top().first.second ; q2.push({ { a[q1.top().second] ,a[q1.top().second] - b[q1.top().second] },q1.top().second }); q1.pop(); } while(q2.size()> B && q1.size() < A){ ans+=q2.top().first.second ; q1.push({ {b[q2.top().second] , b[q2.top().second] - a[q2.top().second]} , q2.top().second}) ; q2.pop(); } if(q1.size() > A){ gA = q1.size() -A ; priority_queue<long long> aux ; while(q1.size()){ aux.push(-a[q1.top().second]) ; q1.pop() ; } while(gA--){ ans+=aux.top() ; aux.pop(); } } if(q2.size() > B){ gB = q2.size() -B ; priority_queue<long long> aux ; while(q2.size()){ aux.push(-b[q2.top().second]) ; q2.pop() ; } while(gB--){ ans+=aux.top() ; aux.pop(); } } cout<<ans; return 0 ; }

Compilation message (stderr)

school.cpp: In function 'int main()':
school.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q1.size()> A && q2.size() < B){
           ~~~~~~~~~^~~
school.cpp:28:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q1.size()> A && q2.size() < B){
                           ~~~~~~~~~~^~~
school.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q2.size()> B && q1.size() < A){
           ~~~~~~~~~^~~
school.cpp:34:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q2.size()> B && q1.size() < A){
                           ~~~~~~~~~~^~~
school.cpp:39:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(q1.size() > A){
        ~~~~~~~~~~^~~
school.cpp:51:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(q2.size() > B){
        ~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...