187222025-10-31 19:58:54algoproPontos Átlagcpp17Wrong answer 60/10093ms1200 KiB
// UUID: 2b8de831-a568-4ab0-ab51-2bfdc2db4ddc
#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;}
	else if (k*n == sum){ cout <<0;return 0;}

	else{

	sort(v.rbegin(),v.rend());
	x = 0;

	for (int i = 0; i <n; i++){
		if (sum >n*k) {sum-= v[i]-1; x++;}
		else break;
	}
	
	

    cout <<x;

}
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms500 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms516 KiB
4Accepted1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms508 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms376 KiB
12Accepted1ms316 KiB
13Accepted1ms316 KiB
subtask340/40
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Accepted1ms316 KiB
17Accepted1ms316 KiB
18Accepted1ms316 KiB
19Accepted1ms316 KiB
20Accepted1ms316 KiB
21Accepted1ms400 KiB
22Accepted1ms316 KiB
23Accepted1ms316 KiB
24Accepted2ms316 KiB
25Accepted2ms316 KiB
26Accepted1ms316 KiB
subtask40/40
27Wrong answer93ms1076 KiB
28Partially correct93ms1076 KiB
29Wrong answer71ms1200 KiB
30Partially correct93ms1076 KiB
31Partially correct93ms1076 KiB
32Partially correct93ms1076 KiB
33Wrong answer71ms1080 KiB
34Partially correct93ms1076 KiB
35Partially correct93ms1076 KiB
36Wrong answer78ms1188 KiB
37Accepted71ms1076 KiB
38Accepted41ms1076 KiB
39Accepted89ms1076 KiB
40Accepted90ms1076 KiB
41Accepted68ms1076 KiB
42Accepted90ms1192 KiB
43Accepted61ms1076 KiB