# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671158 | Nimbostratus | 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 <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
using lint = long long;
const int maxn = 1005;
const int inf = 1e9 + 5;
const int mod = 1e9 + 7;
int n;
int t[maxn], z[maxn];
int tot;
int ans;
signed main() {
#ifdef Local
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> t[i] >> z[i];
tot += t[i];
t[i] = 0;
}
while(tot) {
int maxz = 0;
for(int i = 1; i <= n; i++) {
if(z[maxz] < z[i])
maxz = i;
}
int x = min(tot, z[maxz]);
tot -= x;
z[maxz] -= x;
t[maxz] += x;
}
for(int i = 1; i <= n; i++)
ans += t[i] == 0;
cout << ans << endl;
for(int i = 1; i <= n; i++)
cout << t[i] << " ";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |