Submission #225145

#	Time	Username	Problem	Language	Result	Execution time	Memory
225145		VEGAnn	Simfonija (COCI19_simfonija)	C++14	44 / 110	59 ms	8332 KiB

simfonija

#include <bits/stdc++.h>
#define sz(x) ((ll)x.size())
#define MP make_pair
#define PB push_back
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
using namespace std;
typedef long long ll;
const ll N = 100100;
const ll OO = 1e18;
vector<pll> lf, rt;
vector<pll> qr;
ll n, k, a[N], b[N], sum_lf, sum_rt, extra_lf, extra_rt, pref = 0;
ll ptr_lf, ptr_rt;

ll extra(){
    return extra_lf + extra_rt + pref * ll(ptr_lf) - pref * ll(ptr_rt);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> k;

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

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

        qr.PB(MP(b[j] - a[j], j));
    }

    ll ans = OO;

    sort(all(qr));

    ll i = 0, j = 0;
    while (j < n && qr[i].ft == qr[j].ft){
        lf.PB(MP(0, qr[i].sd));
        j++;
    }

    i = j;

    if (j == sz(qr)){
        cout << 0;
        return 0;
    }

    ptr_rt = min(n - j, k);
    ptr_lf = k - ptr_rt;

    for (ll I = j; I < n; I++){
        ll nw = -(a[qr[I].sd] + qr[0].ft) + b[qr[I].sd];
        rt.PB(qr[I]);
        sum_rt += nw;

        if (I + ptr_rt >= n){
            extra_rt += nw;
        }
    }

    reverse(all(rt));

    ans = min(sum_lf + sum_rt - extra(), ans);

    for (; i < n; ){
        pref += qr[i].ft - qr[i - 1].ft;

        j = i;
        while (j < n && qr[i].ft == qr[j].ft){
            sum_rt += a[qr[j].sd] + qr[0].ft - b[qr[j].sd];

            lf.PB(MP(-pref, qr[j].sd));
            sum_lf += -pref;

            if (ptr_rt >= sz(rt)){
                extra_rt += a[qr[j].sd] + qr[0].ft - b[qr[j].sd];
                ptr_rt--;

                extra_lf += lf[ptr_lf].ft;
                ptr_lf++;
            }

            rt.pop_back();
            j++;
        }

        while (ptr_rt > 0 && lf[ptr_lf].ft + pref >= -(a[rt[ptr_rt - 1].sd] + qr[0].ft) + b[rt[ptr_rt - 1].sd] - pref) {
            extra_lf += lf[ptr_lf].ft + pref;
            ptr_lf++;

            extra_rt -= -(a[rt[ptr_rt - 1].sd] + qr[0].ft) + b[rt[ptr_rt - 1].sd] - pref;
            ptr_rt--;
        }

        ans = min(ans, sum_lf + sum_rt + pref * sz(lf) - pref * sz(rt) - extra());
        i = j;
    }

    cout << ans;

    return 0;
}

• 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: 0 / 11