# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89032 | Lkvatashidze | Schools (IZhO13_school) | C++17 | 463 ms | 19324 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 ll long long
using namespace std;
multiset < pair < int, pair < int, int > > > x;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, s;
cin >> n >> m >> s;
for (int k=1; k<=n; k++) {
int f, s;
cin >> f >> s;
x.insert({-(f+s),{f,s}});
}
ll ans=0;
while (!x.empty()) {
pair < int, pair < int, int > > f=(*x.begin());
x.erase(x.begin());
if (f.second.first>=f.second.second & m) {
m--;
ans+=f.second.first;
continue;
}
if (f.second.first<=f.second.second && s) {
s--;
ans+=f.second.second;
continue;
}
if (s) {
s--;
ans+=f.second.second;
continue;
}
if (m) {
m--;
ans+=f.second.first;
continue;
}
break;
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |