oj.uz

답안 #225022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225022 2020-04-19T08:11:25 Z Vimmer Simfonija (COCI19_simfonija) C++14
77 / 110
 808 ms 5504 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 < 40)
    {
        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;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 762 ms 3772 KB Output is correct
2 Correct 566 ms 3776 KB Output is correct
3 Correct 414 ms 3932 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 3804 KB Output is correct
2 Correct 575 ms 3864 KB Output is correct
3 Correct 412 ms 3916 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 743 ms 3800 KB Output is correct
2 Correct 574 ms 3808 KB Output is correct
3 Correct 398 ms 3876 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 3812 KB Output is correct
2 Correct 353 ms 3780 KB Output is correct
3 Correct 455 ms 3784 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 808 ms 4020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 3884 KB Output is correct
2 Incorrect 440 ms 3808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 779 ms 3788 KB Output is correct
2 Correct 458 ms 5504 KB Output is correct
3 Correct 779 ms 5340 KB Output is correct

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 692 ms 3860 KB Output is correct
2 Incorrect 787 ms 5292 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 458 ms 3936 KB Output is correct
2 Correct 452 ms 3836 KB Output is correct
3 Correct 780 ms 3996 KB Output is correct