Submission #731444

#TimeUsernameProblemLanguageResultExecution timeMemory
731444vjudge1Pod starim krovovima (COCI20_psk)C++17
50 / 50
1 ms340 KiB
#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 timeMemoryGrader output
Fetching results...