248702026-02-16 10:44:36SzeredaiNatanaelLeggyorsabb pénzkeresés (50)cpp17Wrong answer 2/50293ms804 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n, k; cin >> n >> k;
	vector<int> v(n);
	for (int i = 0; i < n; ++i)
		cin >> v[i];
	
	//if (k <= 10000) {
	//	sort(v.begin(), v.end());
	//	if(v[0] >= k) {
	//		cout << 1;
	//		return 0;
	//	}
	//}

	int b = 0, j = 1, s = v[0], mini = 10000001, db = 1;
	while (b < n - 1) {		
		if (j == n) {
			++b;
			j = b + 1;
		}

		if (s < k) {
			s += v[j];
			++j;

			++db;
			if (db < mini) {
				mini = db;
			}
		}
		else {
			s = v[b];
			++b;
			j = b + 1;

			db = 1;
		}
	}

	cout << mini;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Wrong answer0/01ms316 KiB
2Time limit exceeded0/0280ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms560 KiB
6Wrong answer0/28ms508 KiB
7Wrong answer0/219ms508 KiB
8Wrong answer0/226ms436 KiB
9Wrong answer0/27ms440 KiB
10Wrong answer0/223ms432 KiB
11Accepted2/230ms804 KiB
12Time limit exceeded0/2293ms564 KiB
13Time limit exceeded0/2206ms564 KiB
14Wrong answer0/279ms564 KiB
15Time limit exceeded0/2202ms564 KiB
16Wrong answer0/276ms564 KiB
17Wrong answer0/270ms564 KiB
18Wrong answer0/2100ms564 KiB
19Time limit exceeded0/2250ms564 KiB
20Wrong answer0/2170ms564 KiB
21Wrong answer0/2108ms796 KiB
22Wrong answer0/2145ms564 KiB
23Time limit exceeded0/2284ms796 KiB
24Wrong answer0/2141ms564 KiB
25Wrong answer0/2179ms564 KiB
26Wrong answer0/2104ms564 KiB
27Wrong answer0/2103ms564 KiB