Submission #158906

# Submission time Handle Problem Language Result Execution time Memory
158906 2019-10-19T12:15:47 Z dolphingarlic Simfonija (COCI19_simfonija) C++14
11 / 110
44 ms 2300 KB
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int d[100000];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    FOR(i, 0, n) cin >> d[i];
    FOR(i, 0, n) {
        int x;
        cin >> x;
        d[i] -= x;
    }
    sort(d, d + n);

    int x = d[n / 2];
    FOR(i, 0, n) {
        d[i] -= x;
        d[i] = abs(d[i]);
    }
    sort(d, d + n);

    int ans = 0;
    FOR(i, 0, n - k) ans += d[i];
    cout << ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 1500 KB Output is correct
2 Correct 32 ms 2172 KB Output is correct
3 Incorrect 33 ms 2300 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 2288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 31 ms 2168 KB Output is correct
2 Incorrect 33 ms 2172 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -