# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671902 | Alihan_8 | Schools (IZhO13_school) | C++17 | 127 ms | 9508 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b; cin >> n >> a >> b;
vector <pair<int,int>> p(n);
for ( auto &[l, r]: p ) cin >> l >> r;
vector <int> pos(n);
iota(all(pos), 0);
sort(all(pos), [&](int &x, int &y){
return p[x].first+p[y].second > p[y].first+p[x].second;
});
int cnt = 0;
priority_queue <int> q;
for ( int i = 0; i < a; i++ ) cnt += p[pos[i]].first;
for ( int i = a; i < n; i++ ) q.push(p[pos[i]].second);
int _b = b;
while ( b-- ){
cnt += q.top(); q.pop();
} b = _b;
int Mx = cnt; cnt = 0;
iota(all(pos), 0);
sort(all(pos), [&](int &x, int &y){
return p[x].second+p[y].first < p[y].second+p[x].first;
});
while ( !q.empty() ) q.pop();
for ( int i = 0; i < b; i++ ) cnt += p[pos[i]].second;
for ( int i = b; i < n; i++ ) q.push(p[pos[i]].first);
while ( a-- ){
cnt += q.top(); q.pop();
}
cout << max(cnt, Mx);
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |