| 17731 | 2025-09-16 18:33:49 | algopro | Pontos Átlag | cpp17 | Wrong answer 0/100 | 1.1s | 2040 KiB |
// UUID: 3b4dedef-b6b3-40be-89cd-6ac5c38173f1
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int atlag;
cin >> N;
cin >> atlag;
vector<int>szamok(N);
vector<int>szortirozott(N);
int osszeg1 = 0;
int osszeg2 = N*atlag;
int temp;
for(int i = 0; i< N; i++){
cin >> temp;
szamok[i] = temp;
osszeg1 += temp;
}
if (osszeg1 < osszeg2){
cout<<1;
}
else if(osszeg1 == osszeg2){
cout<<0;
}
else{
int signed kulombseg=osszeg1-osszeg2;
int vegso_osszeg=1;
int maximum=0;
for (int i1=0; i1<N; i1++) {
for (int i2=0; i2<N; i2++){
if (szamok[i2]<maximum) {
maximum=szamok[i2];
szamok[i2]=0;
}
}
szortirozott[i1]=maximum;
}
for (int i=0; i==1;) {
kulombseg-=szortirozott[i];
if (kulombseg<1) {
i=1;
}
else {
vegso_osszeg++;
}
}
cout << vegso_osszeg;
}
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Wrong answer | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| subtask2 | 0/20 | ||||||
| 3 | Accepted | 1ms | 316 KiB | ||||
| 4 | Accepted | 1ms | 316 KiB | ||||
| 5 | Accepted | 1ms | 316 KiB | ||||
| 6 | Accepted | 1ms | 316 KiB | ||||
| 7 | Accepted | 1ms | 316 KiB | ||||
| 8 | Wrong answer | 1ms | 316 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| 10 | Accepted | 1ms | 316 KiB | ||||
| 11 | Wrong answer | 1ms | 316 KiB | ||||
| 12 | Wrong answer | 1ms | 316 KiB | ||||
| 13 | Accepted | 1ms | 316 KiB | ||||
| subtask3 | 0/40 | ||||||
| 14 | Accepted | 1ms | 316 KiB | ||||
| 15 | Wrong answer | 3ms | 408 KiB | ||||
| 16 | Accepted | 2ms | 316 KiB | ||||
| 17 | Wrong answer | 2ms | 352 KiB | ||||
| 18 | Wrong answer | 2ms | 316 KiB | ||||
| 19 | Wrong answer | 2ms | 316 KiB | ||||
| 20 | Wrong answer | 2ms | 316 KiB | ||||
| 21 | Accepted | 1ms | 316 KiB | ||||
| 22 | Accepted | 2ms | 508 KiB | ||||
| 23 | Wrong answer | 2ms | 404 KiB | ||||
| 24 | Accepted | 2ms | 316 KiB | ||||
| 25 | Wrong answer | 2ms | 316 KiB | ||||
| 26 | Accepted | 2ms | 316 KiB | ||||
| subtask4 | 0/40 | ||||||
| 27 | Time limit exceeded | 1.1s | 1844 KiB | ||||
| 28 | Time limit exceeded | 1.098s | 1844 KiB | ||||
| 29 | Wrong answer | 74ms | 1980 KiB | ||||
| 30 | Time limit exceeded | 1.1s | 1844 KiB | ||||
| 31 | Time limit exceeded | 1.077s | 1932 KiB | ||||
| 32 | Time limit exceeded | 1.083s | 1844 KiB | ||||
| 33 | Wrong answer | 74ms | 2040 KiB | ||||
| 34 | Time limit exceeded | 1.085s | 1844 KiB | ||||
| 35 | Time limit exceeded | 1.088s | 1848 KiB | ||||
| 36 | Wrong answer | 82ms | 1844 KiB | ||||
| 37 | Accepted | 74ms | 1844 KiB | ||||
| 38 | Time limit exceeded | 1.08s | 1844 KiB | ||||
| 39 | Time limit exceeded | 1.09s | 1844 KiB | ||||
| 40 | Time limit exceeded | 1.09s | 1844 KiB | ||||
| 41 | Time limit exceeded | 1.088s | 1844 KiB | ||||
| 42 | Time limit exceeded | 1.078s | 1848 KiB | ||||
| 43 | Time limit exceeded | 1.072s | 1844 KiB | ||||