# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209335 | papa | Pod starim krovovima (COCI20_psk) | C++14 | 6 ms | 376 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;
//ideja da sumu sve tecnosti mozemo da smestimo u sto manje
//casa
//sortiramo opadajuce i onda smestamo dokle treba
int n;
ll a[1005];
ll b[1005];
vector<pair<ll,int> > ve;
ll res[1005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cin >> n;
ll tot = 0;
for(int i=1;i<=n;i++)
{
cin >> a[i] >> b[i];
tot+=a[i];
ve.push_back({b[i],i});
}
sort(ve.begin(),ve.end());
ll temp = tot;
int doo;
for(int i=n-1;i>=0;i--)
{
ll x = ve[i].first;
if(x >= temp)
{
doo = i;
break;
}
else
{
temp-=x;
}
}
cout << n-(n-1-doo+1) << "\n";
for(int i=n-1;i>=doo;i--)
{
int ind = ve[i].second;
res[ind] = min(tot,ve[i].first);
tot-=ve[i].first;
}
for(int i=1;i<=n;i++) cout << res[i] << " ";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |