Submission #1017186

#TimeUsernameProblemLanguageResultExecution timeMemory
1017186vjudge1Pod starim krovovima (COCI20_psk)C++17
50 / 50
2 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; vector<vector<int>> vec; for (int i = 0; i < n; i ++){ int x, y; cin >> x >> y; vec.push_back({y, x, i}); } sort(vec.begin(), vec.end()); int ans = 0; for (int i = 0; i < n; i ++){ int to_pour = vec[i][1]; for (int j = n - 1; j > i; j--){ int mn = min(vec[j][0] - vec[j][1], to_pour); to_pour -= mn; vec[j][1] += mn; } vec[i][1] = to_pour; ans += to_pour == 0; } cout << ans << endl; for (int i = 0; i < n; i ++) reverse(vec[i].begin(), vec[i].end()); sort(vec.begin(), vec.end()); for (int i = 0; i < n; i ++) cout << vec[i][1] << " "; cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...