oj.uz

답안 #671158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671158 2022-12-12T08:58:16 Z Nimbostratus Pod starim krovovima (COCI20_psk) C++17
50 / 50
 1 ms 340 KB 
#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] << " ";
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct