oj.uz

Submission #225184

# Submission time Handle Problem Language Result Execution time Memory
225184 2020-04-19T11:53:24 Z Vimmer Simfonija (COCI19_simfonija) C++14
55 / 110
 139 ms 2812 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 ans = 1e18;

    mid -= 250;

    for (int i = 0; i <= 500; i++)
    {
        mid++;

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

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

            ans = min(ans, sum);
        }

        if (k + mid >= 0 && mid + k < n)
        {
            ll x = -g[k + mid], sum = 0;

            for (int j = k; j < n; j++) sum += abs(g[j] + x);

            ans = min(ans, sum);
        }
    }

    cout << ans << endl;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 2812 KB Output is correct
2 Correct 129 ms 2688 KB Output is correct
3 Correct 123 ms 2680 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 2752 KB Output is correct
2 Correct 137 ms 2808 KB Output is correct
3 Correct 122 ms 2744 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 2680 KB Output is correct
2 Correct 124 ms 2748 KB Output is correct
3 Correct 135 ms 2680 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 2740 KB Output is correct
2 Correct 52 ms 2680 KB Output is correct
3 Incorrect 76 ms 2684 KB Output isn't correct

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2680 KB Output is correct
2 Incorrect 94 ms 2680 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2684 KB Output is correct
2 Incorrect 38 ms 2680 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 2680 KB Output is correct
2 Correct 131 ms 2756 KB Output is correct
3 Correct 105 ms 2688 KB Output is correct