187162025-10-31 19:18:44algoproPontos Átlagcpp17Wrong answer 60/10093ms1268 KiB
// UUID: 66ca8463-ffae-4719-94ec-0f4a2a81deed
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,k,x;
	int sum = 0;
	cin >>n >>k;

	vector<int>v(n);
    for (int i= 0; i <n; i++){ cin >>x; v[i] = x; sum+= x;}

	if (n*k >sum){ cout <<1;return 0;}
	if (k*n == sum){ cout <<0;return 0;}

	sort(v.begin(),v.end(),greater<>());

	int p = sum - k*n;
	x = 0;

	for (int i = 0; i <n; i++){
		if (p>0) {p-= v[i]-1; x+= 1;}
	}
	cout <<x;

	

    

}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms340 KiB
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms316 KiB
12Accepted1ms316 KiB
13Accepted1ms328 KiB
subtask340/40
14Accepted1ms316 KiB
15Accepted1ms508 KiB
16Accepted1ms316 KiB
17Accepted1ms316 KiB
18Accepted1ms316 KiB
19Accepted1ms400 KiB
20Accepted1ms356 KiB
21Accepted1ms316 KiB
22Accepted1ms328 KiB
23Accepted1ms316 KiB
24Accepted1ms316 KiB
25Accepted1ms604 KiB
26Accepted1ms316 KiB
subtask40/40
27Wrong answer93ms1076 KiB
28Partially correct93ms1260 KiB
29Wrong answer74ms1260 KiB
30Partially correct93ms1076 KiB
31Wrong answer93ms1196 KiB
32Partially correct93ms1076 KiB
33Wrong answer74ms1268 KiB
34Wrong answer93ms1196 KiB
35Partially correct93ms1076 KiB
36Wrong answer82ms1188 KiB
37Accepted74ms1076 KiB
38Accepted43ms1076 KiB
39Accepted90ms1076 KiB
40Accepted92ms1076 KiB
41Accepted68ms1260 KiB
42Accepted92ms1076 KiB
43Accepted63ms1268 KiB