# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90822 | antimirage | 학교 설립 (IZhO13_school) | C++14 | 221 ms | 15640 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 fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 3e5 + 5;
int n, x, y, a[N], b[N];
long long ans;
priority_queue < int > q1;
priority_queue < pair <int, int> > q2;
set <int> st;
main()
{
cin >> n >> x >> y;
for (int i = 1; i <= n; i++)
scanf("%d%d", &a[i], &b[i]);
for (int i = 1; i <= x; i++)
q1.push( -a[i] + b[i] ), ans += a[i];
for (int i = x + 1; i <= n; i++)
{
q2.push( mk( b[i], i ) );
st.insert(i);
}
while (y--)
{
while ( !q2.empty() && !st.count( q2.top().sc ) )
q2.pop();
if ( q2.empty() || q1.top() + a[ *st.begin() ] > q2.top().fr )
{
ans += q1.top() + a[ *st.begin() ];
q1.pop();
q1.push( -a[ *st.begin() ] + b[ *st.begin() ] );
st.erase( st.begin() );
}
else{
ans += q2.top().fr;
st.erase( q2.top().sc );
q2.pop();
}
}
cout << ans << endl;
}
/**
3 1 1
5 2
4 1
6 4
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |