# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210609 | mohamedsobhi777 | Schools (IZhO13_school) | C++14 | 326 ms | 16476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
const int N = 3e5 +5 ;
int n , M , S;
vector<pair<int , int > > v;
long long m[N] , s[N] ;
long long pre[N] , suf[N] ;
long long sum , sol;
int main(){
cin>>n>>M>>S;
for(int i = 0 ; i < n ; i++){
cin>>m[i]>>s[i] ;
v.push_back({s[i]-m[i] , i}) ;
}
sort(v.begin() , v.end());
priority_queue<int , vector<int> , greater<int> > q ;
for(int i = 0 ; i <n ; i++){
if(q.size()< M){
sum+=m[v[i].second] ;
q.push(m[v[i].second]);
}else if( q.top() < m[v[i].second] ){
sum+= m[v[i].second] - q.top();
q.pop();
q.push(m[v[i].second]);
}
pre[i] = sum ;
}
while(q.size() )q.pop() ; sum = 0;
for(int i = n-1 ; i>= 0 ; i--){
if(q.size() < S ) {
sum+=s[v[i].second] ;
q.push(s[v[i].second]) ;
}
else if(q.top() < s[v[i].second]) {
sum+=s[v[i].second] - q.top() ;
q.pop() ;
q.push(s[v[i].second]) ;
}
suf[i] = sum;
}
sol = suf[0] ;
for(int i = 0 ; i <n ; i++){
sol = max(sol , pre[i] + suf[i+1]) ;
}
cout<<sol;
return 0 ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |