# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703583 | raysh07 | Schools (IZhO13_school) | C++17 | 190 ms | 24164 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());
bool comp(pair<int, int> c, pair<int, int> d){
return (c.first - c.second > d.first - d.second); //so high a will be first
}
int calc(vector<pair<int, int>> ab, int x, int y)
{
int n = ab.size();
//cout<<n<<" "<<x<<" "<<y<<"\n";
if (x+y==0) return 0;
ab.push_back({INF, 0});
sort(ab.begin(), ab.end(), comp);
vector <int> s(n + 2, 0);
vector <int> s2(n + 2, 0);
multiset <int> a;
s[0] = 0;
for (int i=1; i<=n; i++){
a.insert(ab[i].first);
s[i] = s[i-1] + ab[i].first;
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].second);
s2[i-1] = s2[i] + ab[i].second;
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]);
}
return ans;
}
void Solve()
{
int n, x, y;
cin>>n>>x>>y;
vector <pair<int, int>> a;
for (int i=0; i<n; i++){
int A, B;
cin>>A>>B;
a.push_back({A, B});
}
cout<<calc(a, x, y);
}
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... |