# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875421 | Denkata | Cake 3 (JOI19_cake3) | C++14 | 1 ms | 2652 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 maxn = 2e5+3;
ll i,j,p,q,n,m,k,v[maxn],c[maxn];
pair <ll,ll> inp[maxn];
set <ll> vals;
set <ll> :: iterator it;
ll sum = 0;
bool fl = false;
int l,r;
void add(ll val)
{
if(vals.size()<m-2)
{
vals.insert(val);
sum+=val;
if(vals.size()==m-2)
fl = true,it = vals.begin();
return ;
}
vals.insert(val);//dano ne pravi problemi s it
if(*it<val)
{
sum -= *it;
sum += val;
it++;
}
}
void rem(ll val)
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... |