oj.uz

Submission #225065

# Submission time Handle Problem Language Result Execution time Memory
225065 2020-04-19T08:53:58 Z NONAME Simfonija (COCI19_simfonija) C++17
110 / 110
 45 ms 3456 KB 
#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, nw[N], pf[N];
vector <pair <ll, int> > vec;

void solve() {
    cin >> n >> k;

    if (k >= n - 1) {
        cout << 0;
        return;
    }

    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++)
        nw[i] = a[i] - b[i];

    sort(nw, nw + n);

    for (int i = 0; i < n; i++)
        pf[i] = (i - 1 < 0 ? 0 : pf[i - 1]) + nw[i];

    ans = oo;

    int i = -1;
    int j = n - k;

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

        ll cur = 0;

        int md = (l + r) >> 1;

        cur = nw[md] * (md - l + 1) - (pf[md] - (l - 1 < 0 ? 0 : pf[l - 1])) + (pf[r] - pf[md]) - nw[md] * (r - md);

        ans = min(ans, cur);
        i++; j++;
    }
    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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3448 KB Output is correct
2 Correct 35 ms 3448 KB Output is correct
3 Correct 38 ms 3448 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3452 KB Output is correct
2 Correct 35 ms 3448 KB Output is correct
3 Correct 35 ms 3448 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3452 KB Output is correct
2 Correct 34 ms 3456 KB Output is correct
3 Correct 32 ms 3452 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3456 KB Output is correct
2 Correct 32 ms 3448 KB Output is correct
3 Correct 34 ms 3448 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3456 KB Output is correct
2 Correct 39 ms 3448 KB Output is correct
3 Correct 38 ms 3448 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3456 KB Output is correct
2 Correct 33 ms 3456 KB Output is correct
3 Correct 36 ms 3448 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3448 KB Output is correct
2 Correct 32 ms 3448 KB Output is correct
3 Correct 45 ms 3448 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3448 KB Output is correct
2 Correct 38 ms 3448 KB Output is correct
3 Correct 38 ms 3448 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3456 KB Output is correct
2 Correct 35 ms 3448 KB Output is correct
3 Correct 40 ms 3448 KB Output is correct