# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90756 | YottaByte | Schools (IZhO13_school) | C++14 | 329 ms | 23316 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 <algorithm>
#include <iostream>
#include <queue>
using namespace std;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define ll long long
#define int long long
#define pii pair < int, int >
const int N = 3e5 + 1;
priority_queue < pair < pii, pii > > v;
priority_queue < pair < int, pii >, vector < pair < int, pii > >, greater < pair < int, pii > > > pq;
ll ans;
int u[N];
main()
{
int n, m, s;
cin >> n >> m >> s;
for(int i = 1; i <= n; i++)
{
int a, b;
cin >> a >> b;
v.push( { {b - a, i}, {a, b} } );
pq.push( { a, { b, i } } );
ans += a;
}
int cnt = n - m - s;
while(s--)
{
int mx = v.top().fr.fr, id = v.top().fr.sc;
v.pop();
u[id] = 1;
//cout << id + 1 << endl;
u[id] = 1;
ans += mx;
}
while(cnt)
{
int id = pq.top().sc.sc;
int mn = pq.top().fr;
pq.pop();
if(u[id]) continue;
//puts("Del");
//cout << id + 1 << endl;
cnt--;
u[id] = 1;
ans -= mn;
}
cout << ans << endl;
}
/*
3 1 1
5 2
4 1
6 4
7 2 3
9 8
10 6
3 5
1 7
5 7
6 3
5 4
5 1 1
6 16
2 14
4 5
4 19
15 19
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |