# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524356 | ezdp | Schools (IZhO13_school) | C++14 | 229 ms | 13252 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.
#pragma GCC target ("sse4")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define ll long long int
#define ld long double
#define lsb(idx) idx&(-idx)
#define bin(x) bitset<32>(x).to_string()
#define all(A) A.begin(), A.end()
#define de(x) cout << #x << " = " << x << endl;
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using matrix = vector<vector<T>>;
/// find_by_order(x) -> x-th element in the set
/// order_of_key(x) -> how many elements are less than x
/// insert(x) -> inserts x into the set
int main(){
/// ios_base::sync_with_stdio(false); cin.tie(NULL);
/// freopen("filename.in" , "r", stdin);
/// freopen("filename.out", "w", stdout);
ll n, m, s; cin >> n >> m >> s;
vector<tuple<ll, ll, ll>> A(n);
vector<ll> pref(n), suff(n);
for(auto &[diff, x, y] : A){
cin >> x >> y;
diff = y - x;
}
sort(all(A));
priority_queue<ll> pq;
for(ll i = 0, sum = 0; i < n; i ++){
ll x = get<1>(A[i]);
ll y = get<2>(A[i]);
sum += x;
pq.push(-x);
if((i + 1) > m){
sum += pq.top();
pq.pop();
}
pref[i] = sum;
}
while(!pq.empty()) pq.pop();
for(ll i = n - 1, sum = 0; i >= 0; i --){
ll x = get<1>(A[i]);
ll y = get<2>(A[i]);
sum += y;
pq.push(-y);
if(n - i > s){
sum += pq.top();
pq.pop();
}
suff[i] = sum;
}
ll ans = 0;
for(int i = m - 1; i + s < n; i ++){
ans = max(ans, pref[i] + suff[i + 1]);
}
cout << ans << endl;
}
/**
3 1 1
5 2
4 1
6 4
9
7 2 3
9 8
10 6
3 5
1 7
5 7
6 3
5 4
38
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |