#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1010;
ll ans, n, t[N], z[N], sum = 0;
bool mrk[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("in.txt","r",stdin);
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> t[i] >> z[i];
sum += t[i];
t[i] = 0;
}
ans = n;
for (ll it = 0; it < n && sum > 0; it++){
ll mx = -1, nm = -1;
for (ll i = 0; i < n; i++){
if (mrk[i]) continue;
if (z[i] > mx){
mx = z[i];
nm = i;
}
}
mrk[nm] = 1;
ans--;
ll kol = min(z[nm], sum);
t[nm] = kol;
sum -= kol;
}
cout << ans << '\n';
for (ll i = 0; i < n; i++)
cout << t[i] << " ";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |