Submission #2873190


Source Code Expand

#pragma GCC optimize("O3")
#define first x
#define second y
#include <bits/stdc++.h>

using namespace std;

enum {MOD0 = 1000000000, MOD7 = 1000000007, MOD9 = 1000000009};
typedef unsigned short ushort;typedef unsigned int uint;typedef long long ll;typedef unsigned long long ull;
#ifndef CrafterKolyan
#define endl '\n'
#endif

int a[200000];

signed main() {
#ifndef CrafterKolyan
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    sort(a, a + n);
    int b = a[n / 2];
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += abs(a[i] - b);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Linear Approximation
User CrafterKolyan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 739 Byte
Status WA
Exec Time 34 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 1
WA × 3
AC × 3
WA × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt WA 7 ms 384 KB
subtask_1_03.txt WA 5 ms 384 KB
subtask_1_04.txt WA 12 ms 640 KB
subtask_1_05.txt WA 20 ms 896 KB
subtask_1_06.txt WA 23 ms 1024 KB
subtask_1_07.txt WA 34 ms 1024 KB
subtask_1_08.txt WA 23 ms 1024 KB
subtask_1_09.txt WA 23 ms 1024 KB
subtask_1_10.txt WA 23 ms 1024 KB
subtask_1_11.txt WA 23 ms 1024 KB