Submission #225040

# Submission time Handle Problem Language Result Execution time Memory
225040 2020-04-19T08:19:31 Z Vimmer Simfonija (COCI19_simfonija) C++14
22 / 110
1000 ms 4020 KB
#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;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 3964 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 3964 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 3900 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 487 ms 3848 KB Output is correct
2 Correct 478 ms 3932 KB Output is correct
3 Correct 701 ms 3964 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 3876 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 443 ms 3824 KB Output is correct
2 Incorrect 698 ms 3888 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 4020 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 3948 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 675 ms 3816 KB Output is correct
2 Correct 678 ms 3916 KB Output is correct
3 Execution timed out 1093 ms 3960 KB Time limit exceeded