Submission #225054

#	Time	Username	Problem	Language	Result	Execution time	Memory
225054		NONAME	Simfonija (COCI19_simfonija)	C++17	0 / 110	1099 ms	4208 KiB

simfonija

#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

ll n, k, a[N], b[N], ans;
vector <pair <ll, int> > vec;

void solve() {
    cin >> n >> k;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        cin >> b[i];

    for (int i = 0; i < n; i++)
        vec.pb({a[i] - b[i], i});

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

    ans = oo;

    for (int i = -1; i < n; i++)
    for (int j = n; j >= 0; j--) {
        if (i == -1 && j == n)
            continue;

        if (i + 1 + n - j > k)
            continue;

        int l = 0, r = n - 1;
        if (i != -1)
            l = i + 1;
        if (j != n)
            r = j - 1;

        ll cur = 0;

        for (int z = l; z <= r; z++)
            cur += abs(a[vec[z].sd] - vec[(l + r) / 2].ft - b[vec[z].sd]);

        ans = min(ans, cur);
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 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