# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256239 | blacktulip | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 396 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 lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define int long long
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
multiset<int> st;
vector<int> v;
PII p[li];
main(void){
scanf("%lld",&n);
FOR{
int x;
scanf("%lld %lld",&x,&p[i].fi);
st.insert(x);
p[i].se=i;
}
sort(p+1,p+n+1);
reverse(p+1,p+n+1);
FOR{
auto it=st.end();
if(it==st.begin() || p[i].fi==0){continue;}
it--;
int at=min(p[i].fi,*it);
a[p[i].se]+=at;
p[i].fi-=at;
int bt=*it;
st.erase(it);
if(bt>at)st.insert(bt-at);
i--;
}
FOR{
if(a[i]==0)cev++;
}
printf("%lld\n",cev);
FOR printf("%lld ",a[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |