# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334014 | ronnith | Pod starim krovovima (COCI20_psk) | C++14 | 1 ms | 364 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>
typedef long long ll;
#define mk make_pair
#define f first
#define s second
using namespace std;
int main(){
int n;
scanf("%d", &n);
ll x;
pair<ll, ll> z[n];
ll sm = 0;
ll sum = 0;
for(int i = 0;i < n;i ++){
scanf("%lld%lld", &x, &z[i].f);
z[i].s = i;
sm = sm + x;
sum += z[i].f;
}
sort(z, z + n);
ll cnt = 0;
ll ans = 0;
ll an[n];
for(int i = 0;i < n;i ++){
cnt += z[i].f;
if(sum - cnt >= sm){
ans = i + 1;
} else break;
}
printf("%lld\n", ans);
for(int i = 0;i < n;i ++){
if(i < ans)
an[z[i].s] = 0;
else {
int h = min(sm, z[i].f);
an[z[i].s] = h;
sm -= h;
}
}
for(int i = 0;i < n;i ++){
printf("%lld ", an[i]);
}
puts("");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |