# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703582 | raysh07 | Schools (IZhO13_school) | C++17 | 181 ms | 19504 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;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n, x, y;
const int maxn = 3e5 + 69;
pair<int, int> ab[maxn];
int s[maxn];
int s2[maxn];
bool comp(pair<int, int> c, pair<int, int> d){
return (c.f - c.s > d.f - d.s); //so high a will be first
}
void Solve()
{
cin>>n>>x>>y;
for (int i=1; i<=n; i++)
cin>>ab[i].f>>ab[i].s;
sort(ab+1, ab+n+1, comp);
multiset <int> a;
s[0] = 0;
for (int i=1; i<=n; i++){
a.insert(ab[i].f);
s[i] = s[i-1] + ab[i].f;
if (a.size() > x){
s[i] -= *a.begin();
a.erase(a.find(*a.begin()));
}
}
multiset <int> b;
for (int i=n; i>=1; i--){
b.insert(ab[i].s);
s2[i-1] = s2[i] + ab[i].s;
if (b.size() > y){
s2[i-1] -= *b.begin();
b.erase(b.find(*b.begin()));
}
}
int ans = 0;
for (int i=x; i<=n-y; i++){
ans = max(ans, s[i] + s2[i]);
}
cout<<ans<<"\n";
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |