| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 556678 | sidon | Coins (BOI06_coins) | C++17 | 83 ms | 8524 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>
using namespace std;
const int Z = 5e5 + 1;
int N, K, c[Z], ans, sum;
bool d[Z];
int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> N >> K;
	for(int i = 0; i < N; ++i)
		cin >> c[i] >> d[i];
	c[N] = K;
	for(int i = 0; i < N; ++i) {
		if(!d[i] && c[i] > sum && c[i] + sum < c[i+1]) {
			sum += c[i];
			ans += 1;
		}
	}
	if(!ans) sum = 1;
	cout << ans << '\n' << K - sum;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
