177132025-09-16 17:40:27algoproPontos Átlagcpp17Wrong answer 60/10093ms1312 KiB
// UUID: 19fd92ae-b230-4dd0-9be5-2d7e52f8845a
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    int k;
    cin>>n>>k;

    int q = 0;
    vector<int> p(n);
    for(int i = 0; i < n; i++)
    {
        cin>>p[i];
        q+=p[i];
    }

    sort(p.begin(), p.end());
    reverse(p.begin(), p.end());

    if(n*k > q) cout<<1;
    else if(n*k < q)
    {
        int i = 0;
        while(n*k < q)
        {
            q -= p[i] - 1;
            p[i] = 1;
            i++;
        }

        cout<<i;
    }
    else cout<<0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms500 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms500 KiB
12Accepted1ms500 KiB
13Accepted1ms316 KiB
subtask340/40
14Accepted1ms316 KiB
15Accepted1ms548 KiB
16Accepted1ms316 KiB
17Accepted1ms356 KiB
18Accepted1ms316 KiB
19Accepted1ms404 KiB
20Accepted1ms316 KiB
21Accepted1ms508 KiB
22Accepted1ms396 KiB
23Accepted1ms316 KiB
24Accepted1ms316 KiB
25Accepted1ms316 KiB
26Accepted1ms316 KiB
subtask40/40
27Wrong answer90ms1192 KiB
28Partially correct90ms1268 KiB
29Wrong answer90ms1076 KiB
30Partially correct90ms1192 KiB
31Partially correct90ms1076 KiB
32Partially correct93ms1076 KiB
33Wrong answer90ms1196 KiB
34Partially correct90ms1312 KiB
35Partially correct90ms1260 KiB
36Wrong answer79ms1076 KiB
37Accepted90ms1268 KiB
38Accepted41ms1076 KiB
39Accepted86ms1076 KiB
40Accepted89ms1088 KiB
41Accepted65ms1200 KiB
42Accepted89ms1076 KiB
43Accepted59ms1076 KiB