# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683001 | smartmonky | Schools (IZhO13_school) | C++14 | 182 ms | 15004 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>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
const int N = (int)3e5+7;
int p[N], p2[N];
bool comp(pair <int,int> a, pair <int,int> b){
return a.ff - a.ss > b.ff - b.ss;
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, s;
cin >> n >> m >> s;
vector <pair <int,int> > vp(n);
for(int i = 0; i < n; i++){
cin >> vp[i].ff >> vp[i].ss;
}
sort(all(vp), comp);
multiset <int> st;
int sum = 0;
for(int i = 0; i < n; i++){
sum += vp[i].ff;
st.insert(vp[i].ff);
if(st.size() > m){
sum -= *(st.begin());
st.erase(st.begin());
}
p[i] = sum;
}
st.clear();
sum = 0;
for(int i = n - 1; i >= 1; i--){
sum += vp[i].ss;
st.insert(vp[i].ss);
if(st.size() > s){
sum -= *(st.begin());
st.erase(st.begin());
}
p2[i] = sum;
}
int ans = 0;
for(int i = m - 1; i < n - s; i++){
ans = max(ans, p[i] + p2[i + 1]);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |