Submission #198016

#TimeUsernameProblemLanguageResultExecution timeMemory
198016alradPod starim krovovima (COCI20_psk)C++17
50 / 50
3 ms380 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base :: sync_with_stdio(0); cin.tie(0) , cout.tie(0); int n; cin >> n; vector<pair<int , pair<int , int> > > a(n); for (int i = 0; i < n; i++) { int x , y; cin >> x >> y; a[i] = {i , {x , y}}; } auto comp = [&](pair<int , pair<int , int> > &x , pair<int , pair<int , int> > &y) { return x.second.second > y.second.second; }; int tot = 0; vector<int> ans(n); sort(a.begin() , a.end() , comp); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (a[j].second.first == 0) { continue; } int delta = min(a[j].second.first , a[i].second.second - a[i].second.first); a[j].second.first -= delta; a[i].second.first += delta; } ans[a[i].first] = a[i].second.first; tot += (a[i].second.first == 0); } cout << tot << '\n'; for (auto e : ans) { cout << e << " "; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...