187242025-10-31 20:00:58algoproPontos Átlagcpp17Wrong answer 60/100101ms1268 KiB
// UUID: 5857c309-a8fa-4439-8aec-57529bdd68a7
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,k,x;
	long long 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
1Accepted1ms508 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms316 KiB
4Accepted1ms508 KiB
5Accepted1ms400 KiB
6Accepted1ms320 KiB
7Accepted1ms316 KiB
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms316 KiB
12Accepted1ms508 KiB
13Accepted1ms316 KiB
subtask340/40
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Accepted2ms316 KiB
17Accepted1ms500 KiB
18Accepted1ms316 KiB
19Accepted1ms316 KiB
20Accepted2ms316 KiB
21Accepted1ms316 KiB
22Accepted1ms316 KiB
23Accepted1ms500 KiB
24Accepted2ms316 KiB
25Accepted1ms392 KiB
26Accepted1ms508 KiB
subtask40/40
27Wrong answer94ms1076 KiB
28Partially correct94ms1076 KiB
29Partially correct94ms1076 KiB
30Partially correct94ms1076 KiB
31Partially correct96ms1192 KiB
32Partially correct96ms1076 KiB
33Partially correct94ms1076 KiB
34Partially correct101ms1268 KiB
35Partially correct94ms1076 KiB
36Accepted87ms1076 KiB
37Wrong answer96ms1076 KiB
38Accepted43ms1076 KiB
39Partially correct90ms1076 KiB
40Wrong answer93ms1076 KiB
41Partially correct68ms1076 KiB
42Wrong answer93ms1076 KiB
43Accepted64ms1076 KiB