# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647474 | k_balint31415 | Paths (RMI21_paths) | C++14 | 318 ms | 20992 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;
typedef long long ll;
const int c=1e5+5;
int n,k;
multiset<ll> nagy,kicsi;
ll ossz=0;
void ins(ll a){
if(nagy.size()<k) {ossz+=a; nagy.insert(a); return;}
ll nb=*nagy.begin();
if(nb>=a) {kicsi.insert(a); return;}
kicsi.insert(nb);
ossz-=nb;
nagy.erase(nagy.find(nb));
ossz+=a; nagy.insert(a);
}
void rem(ll a){
if(kicsi.find(a) != kicsi.end()){
kicsi.erase(kicsi.find(a)); return;
}
if(nagy.find(a) == nagy.end()) return;
ossz-=a;
nagy.erase(nagy.find(a));
if(!kicsi.empty()) {auto it=kicsi.end(); it--; ll b=*it; ossz+=b; nagy.insert(b); kicsi.erase(kicsi.find(b));}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |