# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638252 | iee | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 212 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.
// iee
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#define rep(i, a, b) for (auto i = (a); i <= (b); ++i)
#define per(i, a, b) for (auto i = (a); i >= (b); --i)
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using namespace std;
void work(int);
template <class T> void read(T &x) {
x = 0; int f = 1, ch = getchar();
while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + (ch - '0'), ch = getchar();
x *= f;
}
int main() {
int TT = 1; // cin >> TT;
rep(CAS, 1, TT)
work(CAS);
return 0;
}
const int N = 1005;
int n, ans[N], cnt;
ll sum;
pair<int, int> a[N];
void work(int CASE) {
cin >> n;
rep(i, 1, n) {
int x;
cin >> x;
sum += x;
cin >> a[i].fi;
a[i].se = i;
}
sort(a + 1, a + n + 1, greater<pair<int, int>>());
rep(i, 1, n)
if (sum > 0) ans[a[i].se] = min(sum, (ll) a[i].fi), sum -= min(sum, (ll) a[i].fi);
else ++cnt;
cout << cnt << '\n';
rep(i, 1, n) cout << ans[i] << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |