Submission #225184

#	Time	Username	Problem	Language	Result	Execution time	Memory
225184		Vimmer	Simfonija (COCI19_simfonija)	C++14	55 / 110	139 ms	2812 KiB

simfonija

#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 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 11 / 11