oj.uz

답안 #225181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225181 2020-04-19T11:48:54 Z Vimmer Simfonija (COCI19_simfonija) C++14
55 / 110
 41 ms 2816 KB 
#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 200005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;

typedef long double ld;




int main()
{

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n, k;

    cin >> n >> k;

    ll a[n], b[n];

    for (ll i = 0; i < n; i++) cin >> a[i];

    for (ll i = 0; i < n; i++) cin >> b[i];

    vector <ll> g(n);

    for (ll i = 0; i < n; i++) g[i] = a[i] - b[i];

    sort(g.begin(), g.end());

    ll mid = (n - k) / 2;

    ll x = -g[mid];

    ll ans = 0;

    for (ll i = 0; i < n - k; i++) ans += abs(g[i] + x);

    ll sum = 0;

    x = -g[mid + k];

    for (ll i = k; i < n; i++) sum += abs(g[i] + x);

    ans = min(ans, sum);

    mid--;

    if (mid >= 0 && mid < n)
    {
        x = -g[mid];

        ll sum = 0;

        for (ll i = 0; i < n - k; i++) sum += abs(g[i] + x);

        ans = min(sum, ans);
    }

    if (mid + k < n && mid + k >= 0)
    {
        ll sum = 0;

        x = -g[mid + k];

        for (ll i = k; i < n; i++) sum += abs(g[i] + x);

        ans = min(ans, sum);
    }

    mid += 2;

    if (mid >= 0 && mid < n)
    {
        x = -g[mid];

        ll sum = 0;

        for (ll i = 0; i < n - k; i++) sum += abs(g[i] + x);

        ans = min(sum, ans);
    }

    if (mid + k < n && mid + k >= 0)
    {
        ll sum = 0;

        x = -g[mid + k];

        for (ll i = k; i < n; i++) sum += abs(g[i] + x);

        ans = min(ans, sum);
    }

    cout << ans << endl;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 2688 KB Output is correct
2 Correct 36 ms 2680 KB Output is correct
3 Correct 34 ms 2680 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 2680 KB Output is correct
2 Correct 34 ms 2688 KB Output is correct
3 Correct 34 ms 2680 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2680 KB Output is correct
2 Correct 36 ms 2688 KB Output is correct
3 Correct 34 ms 2688 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 2816 KB Output is correct
2 Correct 37 ms 2684 KB Output is correct
3 Incorrect 38 ms 2688 KB Output isn't correct

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2680 KB Output is correct
2 Incorrect 34 ms 2680 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 39 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 2808 KB Output is correct
2 Incorrect 36 ms 2816 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 2680 KB Output is correct
2 Correct 35 ms 2720 KB Output is correct
3 Correct 40 ms 2720 KB Output is correct