# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844301 | vjudge1 | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 600 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;
#define pb push_back
#define endl "\n"
#define int long long
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void solve()
{
int n;
cin >> n;
vector<array<int,3>> ans;
int go[n+1];
int hm=0;
for(int i=1;i<=n;i++)
{
int a,b;
cin >> a >> b;
hm+=a;
ans.pb({b,a,i});
}
sort(rall(ans));
for(int i=0;i<n;i++)
{
if(hm>ans[i][0])
{
hm-=ans[i][0];
go[ans[i][2]]=ans[i][0];
}
else
{
go[ans[i][2]]=hm;
break;
}
}
int sum=0;
for(int i=1;i<=n;i++) sum+=(go[i]==0);
for(int i=1;i<=n;i++) cout << go[i] << " \n"[i==n];
}
int32_t main(){
cin.tie(0); ios::sync_with_stdio(0);
int t=1;//cin >> t;
while(t--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |