177922025-09-17 18:20:15algoproPontos Átlagcpp17Partially correct 40/10025ms2032 KiB
// UUID: d21073d5-a42c-4280-9eca-bfe7444531aa
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k;
    cin >> n >> k;
    vector<long long> p(n);
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        sum += p[i];
    }

    long long target = 1LL * n * k;

    if (sum == target) {
        cout << 0 << "\n";
        return 0;
    }

    // ellenőrizzük, hogy 1 elem átírásával elérhető-e
    for (int i = 0; i < n; i++) {
        long long x = target - (sum - p[i]); 
        if (x > 0) {
            cout << 1 << "\n";
            return 0;
        }
    }

    // ha nem, akkor biztosan 2
    cout << 2 << "\n";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms508 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms352 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms316 KiB
12Accepted1ms548 KiB
13Accepted1ms364 KiB
subtask310/40
14Accepted1ms316 KiB
15Partially correct1ms508 KiB
16Accepted1ms316 KiB
17Partially correct1ms316 KiB
18Partially correct1ms316 KiB
19Partially correct1ms316 KiB
20Partially correct1ms316 KiB
21Accepted1ms316 KiB
22Accepted1ms316 KiB
23Accepted1ms316 KiB
24Accepted1ms316 KiB
25Accepted1ms384 KiB
26Accepted1ms316 KiB
subtask410/40
27Accepted24ms1844 KiB
28Partially correct24ms1844 KiB
29Partially correct24ms1844 KiB
30Partially correct24ms1844 KiB
31Partially correct24ms1908 KiB
32Partially correct24ms1844 KiB
33Partially correct24ms1844 KiB
34Partially correct24ms1844 KiB
35Partially correct24ms2028 KiB
36Partially correct25ms1844 KiB
37Accepted24ms1844 KiB
38Accepted16ms2028 KiB
39Accepted24ms1860 KiB
40Accepted25ms1844 KiB
41Accepted21ms1868 KiB
42Accepted25ms2004 KiB
43Accepted19ms2032 KiB