Submission #225040

#	Time	Username	Problem	Language	Result	Execution time	Memory
225040		Vimmer	Simfonija (COCI19_simfonija)	C++14	22 / 110	1098 ms	4020 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 100005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;

typedef long double ld;


ll a[N], b[N], n, k;

ll calc(ll x)
{
    ll sum = 0;

    vector <ll> g; g.clear();

    for (int i = 0; i < n; i++) g.pb(abs((a[i] + x) - b[i]));

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

    int kk = k;

    while (kk > 0)
    {
        kk--;

        g.pop_back();
    }

    for (int i = 0; i < sz(g); i++) sum += g[i];

    return sum;
}
int main()
{

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

    cin >> n >> k;

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

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

    int l = -1000000, r = 1000000;

    int q = 0;

    while (q < 25)
    {
        int mdl = l + (r - l) / 3;

        int mdr = r - (r - l) / 3;

        if (calc(mdl) > calc(mdr)) l = mdl; else r = mdr;

        q++;
    }

    ll ans = 1e18;

    for (int i = l; i <= r; i++) ans = min(ans, calc(i));

    cout << ans << endl;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 11 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11