# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672188 | Alihan_8 | Schools (IZhO13_school) | C++17 | 105 ms | 11396 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, m, s; cin >> n >> m >> s;
vector <pair<int,int>> p(n);
for ( auto &[l, r]: p ) cin >> l >> r;
sort(all(p), [&](pair <int,int> &l, pair <int,int> &r){
return (l.first-l.second) > (r.first-r.second);
});
priority_queue <int> q;
vector <int> L(n), R(n);
int cnt = 0;
for ( int i = 0; i < n; i++ ){
auto [l, r] = p[i];
q.push(-l);
cnt += l;
while ( (int)q.size() > m ){
cnt -= -q.top();
q.pop();
}
L[i] = cnt;
}
cnt = 0;
while ( !q.empty() ) q.pop();
for ( int i = n-1; i >= 0; i-- ){
auto [l, r] = p[i];
q.push(-r);
cnt += r;
while ( (int)q.size() > s ){
cnt -= -q.top();
q.pop();
}
R[i] = cnt;
}
int Mx = max(R[0], L.back());
for ( int i = 0; i+1 < n; i++ ){
Mx = max(Mx, L[i]+R[i+1]);
}
cout << Mx;
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |