# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363234 | Ruxandra985 | Schools (IZhO13_school) | C++14 | 611 ms | 15340 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 DIMN 300010
using namespace std;
int x[DIMN] , y[DIMN];
pair <int , int> v[DIMN];
multiset <int> w , p;
int cmp (pair <int , int> a , pair <int , int> b){
return a > b;
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , s , i , aux ,idx;
long long suma , sol = 0;
multiset<int> :: iterator it , it2;
fscanf (fin,"%d%d%d",&n,&m,&s);
for (i = 1 ; i <= n ; i++){
fscanf (fin,"%d%d",&x[i],&y[i]);
v[i] = make_pair(x[i] - y[i] , i);
}
sort (v + 1 , v + n + 1 , cmp);
/// v = ordinea prioritatilor
suma = 0;
for (i = 1 ; i <= m ; i++){
suma += x[v[i].second];
}
for (i = m + 1 ; i <= n ; i++){
w.insert(y[v[i].second]);
}
idx = 0;
while (idx < s){
it = w.end();
it--;
idx++;
p.insert(*it);
w.erase(it);
suma += *it;
}
/// aux e cea mai mica valoare luata din sufixul ala
sol = suma;
for (i = m + 1 ; i <= n ; i++){
suma -= x[v[i - m].second];
suma += x[v[i].second];
/// cele mai mari s uri
/// adaugi i - m ul
if (y[v[i - m].second] >= *p.begin()){ /// ai o pb, il adaugi
suma -= *p.begin();
suma += y[v[i - m].second];
w.insert(*p.begin());
p.erase(p.begin());
p.insert(y[v[i - m].second]);
}
else w.insert(y[v[i - m].second]);
/// scoti i ul din multiset
if (y[v[i].second] >= *p.begin()){ /// ai o pb, era in p
suma -= y[v[i].second];
p.erase(p.lower_bound(y[v[i].second]));
it = w.end();
it--;
p.insert(*it);
w.erase(it);
suma += *it;
}
else w.erase(w.lower_bound(y[v[i].second]));
/// it vreau sa fie prima pozitie a lui aux
sol = max(sol , suma);
}
fprintf (fout,"%lld",sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |