# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638248 | Register | Pod starim krovovima (COCI20_psk) | C++14 | 1 ms | 212 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 N=1005;
int n,cnt,id[N],a[N],b[N],ans[N];
ll s;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]),s+=a[i],id[i]=i;
sort(id+1,id+n+1,[&](int x,int y){return b[x]>b[y];});
cnt=n;
for(int i=1;i<=n&&s;i++) cnt--,s-=(ans[id[i]]=min(s,(ll)b[id[i]]));
printf("%d\n",cnt);
for(int i=1;i<=n;i++) printf("%d ",ans[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |