Submission #225136

#	Time	Username	Problem	Language	Result	Execution time	Memory
225136		kartel	Simfonija (COCI19_simfonija)	C++14	110 / 110	41 ms	3704 KiB

simfonija

#include <bits/stdc++.h>
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define F first
#define S second
#define pb push_back
#define M ll(998244353)
#define inf ll(2e9+7)
#define N ll(200500)
#define sz(x) x.size()
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#define el '\n'
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> os;

ll a[N], b[N], i, n, k, ans = 1e18, kl, sm, sum, pr[N], l, r;
vector <ll> ve;

int main()
{
//    in("input.txt");
//    out("output.txt");

    ios_base::sync_with_stdio(false);
    iostream::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for (i = 1; i <= n; i++) cin >> a[i];
    for (i = 1; i <= n; i++) cin >> b[i];

    for (i = 1; i <= n; i++) ve.pb(a[i] - b[i]);

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

    pr[0] = ve[0];

    for (i = 1; i < n; i++) pr[i] = pr[i - 1] + ve[i];

    l = 0;
    r = n - k - 1;
    while (r <= n - 1)
    {
        int md = (l + r) >> 1;

        ll left = ve[md] * (md - l + 1) - (pr[md] - ((l - 1 >= 0) ? pr[l - 1] : 0));
        ll right = (pr[r] - pr[md]) - ve[md] * (r - md);

        ans = min(ans, left + right);

        l++;
        r++;
    }

    cout << ans;
}

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