163982025-04-29 12:33:48ercseferencPontos Átlagcpp17Wrong answer 0/100103ms1268 KiB
#include <bits/stdc++.h>
using namespace std;
bool has(int n, int m){
    return n>m;}
int main()
{
    int n,k,p=0,s=0;
    cin>>n>>k; vector<int>ar(n);
    for(int i=0; i<n; i++){cin>>ar[i];s+=ar[i];}
    sort(ar.begin(), ar.end(),has);
    if(s/n<k)cout<<1;
    else if(s/n==k)cout<<0;
    else {
        while(s/n>k){s-=(ar[p]-1); p++;}
        cout<<p+1;}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms508 KiB
subtask20/20
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms532 KiB
6Accepted1ms316 KiB
7Wrong answer1ms388 KiB
8Wrong answer1ms316 KiB
9Wrong answer1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms316 KiB
12Accepted1ms316 KiB
13Wrong answer1ms316 KiB
subtask30/40
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Wrong answer1ms316 KiB
17Partially correct1ms316 KiB
18Partially correct2ms404 KiB
19Partially correct1ms316 KiB
20Wrong answer1ms520 KiB
21Accepted1ms316 KiB
22Wrong answer1ms316 KiB
23Accepted1ms316 KiB
24Wrong answer1ms316 KiB
25Accepted1ms508 KiB
26Wrong answer1ms316 KiB
subtask40/40
27Accepted97ms1076 KiB
28Wrong answer98ms1188 KiB
29Wrong answer97ms1076 KiB
30Wrong answer97ms1268 KiB
31Wrong answer98ms1076 KiB
32Wrong answer97ms1076 KiB
33Wrong answer97ms1076 KiB
34Wrong answer97ms1268 KiB
35Wrong answer97ms1076 KiB
36Wrong answer89ms1076 KiB
37Wrong answer97ms1076 KiB
38Wrong answer48ms1076 KiB
39Wrong answer93ms1076 KiB
40Accepted103ms1076 KiB
41Wrong answer72ms1076 KiB
42Accepted97ms1192 KiB
43Wrong answer67ms1076 KiB