제출 #290963

#제출 시각아이디문제언어결과실행 시간메모리
290963penguinhackerPod starim krovovima (COCI20_psk)C++17
50 / 50
1 ms396 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=1000;
int n, a[mxN], cap[mxN], ind[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;
	for (int i=0; i<n; ++i) cin >> a[i] >> cap[i];
	ll tot=accumulate(a, a+n, 0ll);
	iota(ind, ind+n, 0);
	sort(ind, ind+n, [](int x, int y) {return cap[x]<cap[y];});
	for (int i=n-1; ~i; --i) {
		int cur=ind[i];
		int x=min(tot, (ll)cap[cur]);
		a[cur]=x;
		tot-=x;
	}
	int ans=count(a, a+n, 0);
	cout << ans << "\n";
	for (int i=0; i<n; ++i) cout << a[i] << " ";
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...