177142025-09-16 17:42:32algoproPontos Átlagcpp17Wrong answer 60/10094ms1268 KiB
// UUID: 0bc32bc8-04c8-46f1-b729-7b0ec0c2ab1a
#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;
            i++;
        }

        cout<<i;
    }
    else cout<<0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms508 KiB
subtask220/20
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms316 KiB
9Accepted1ms508 KiB
10Accepted1ms316 KiB
11Accepted1ms316 KiB
12Accepted1ms500 KiB
13Accepted1ms316 KiB
subtask340/40
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Accepted2ms332 KiB
17Accepted2ms332 KiB
18Accepted1ms400 KiB
19Accepted1ms316 KiB
20Accepted1ms316 KiB
21Accepted1ms316 KiB
22Accepted1ms512 KiB
23Accepted1ms500 KiB
24Accepted1ms316 KiB
25Accepted1ms508 KiB
26Accepted1ms316 KiB
subtask40/40
27Wrong answer93ms1076 KiB
28Partially correct93ms1196 KiB
29Wrong answer93ms1196 KiB
30Partially correct93ms1076 KiB
31Partially correct93ms1076 KiB
32Partially correct93ms1080 KiB
33Wrong answer93ms1076 KiB
34Partially correct93ms1196 KiB
35Partially correct94ms1268 KiB
36Wrong answer85ms1076 KiB
37Accepted93ms1076 KiB
38Accepted43ms1076 KiB
39Accepted90ms1076 KiB
40Accepted92ms1208 KiB
41Accepted68ms1076 KiB
42Accepted92ms1076 KiB
43Accepted64ms1268 KiB