# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731443 | eneskav | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 340 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 <iostream>
#include <algorithm>
#define int long long
using namespace std;
bool sorter(pair<int, int> a, pair<int, int> b)
{
return a.second > b.second;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
pair<int, int> a[n];
int val[n];
int t = 0;
for (int i = 0; i < n; ++i)
{
a[i].first = i;
int x;
cin >> x;
t += x;
cin >> a[i].second;
val[i] = 0;
}
sort(a, a + n, sorter);
int ans = n;
for (int i = 0; i < n; ++i)
{
if (t <= 0)
break;
int diff = min(t, a[i].second);
t -= diff;
ans--;
val[a[i].first] = diff;
}
cout << ans << endl;
for (int i = 0; i < n; ++i)
{
cout << val[i] << " ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |