# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844215 | vjudge1 | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 384 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>
#define endl "\n"
#define pb push_back
#define int long long
using namespace std;
const int inf = 2e18 + 5;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int32_t main(){
//freopen("in.txt","r", stdin);
int n;
cin>>n;
vector<pair<int,int> > g(n);
int s = 0;
for(int i = 0; i < n; i++){
int x, y;
cin>>x>>y;
s += x;
g[i] = {y, i};
}
sort(g.rbegin(), g.rend());
vector<int> ans(n);
int cnt = 0;
for(int i = 0; i < n; i++){
if(s > g[i].first){
cnt++;
ans[g[i].second] = g[i].first;
s -= g[i].first;
}
else{
cnt++;
ans[g[i].second] = s;
break;
}
}
cout<<n - cnt<<endl;
for(auto itr: ans) cout<<itr<<" ";
cout<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |