oj.uz

Submission #225037

# Submission time Handle Problem Language Result Execution time Memory
225037 2020-04-19T08:19:12 Z kartel Simfonija (COCI19_simfonija) C++14
44 / 110
 513 ms 3780 KB 
#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, c[N], l, r;

bool cmp(int a, int b) {return (a > b);}

ll ans(ll x)
{
    vector <int> p;

    ll kl = 0;

    for (i = 1; i <= n; i++) c[i] = a[i] + x;

    for (i = 1; i <= n; i++) p.pb(abs(c[i] - b[i])), kl += abs(c[i] - b[i]);

    sort(p.begin(), p.end(), cmp);

    i = 0;
    while (i < k) kl -= p[i], i++;

    return kl;
}

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];

    l = -1e6;
    r = 1e6;

    while (r - l > 10)
    {
        int md = (l + r) >> 1;
        if (ans(md) < ans(md + 1)) r = md;
                              else l = md + 1;
    }

    ll an = 1e18;

    for (; l <= r; l++) an = min(an, ans(l));

    cout << an;

}

Subtask #1
11.0 / 11.0

# 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 4 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 473 ms 3692 KB Output is correct
2 Correct 373 ms 3700 KB Output is correct
3 Correct 275 ms 3672 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 3716 KB Output is correct
2 Correct 376 ms 3716 KB Output is correct
3 Correct 284 ms 3696 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 466 ms 3668 KB Output is correct
2 Correct 385 ms 3768 KB Output is correct
3 Correct 284 ms 3700 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 230 ms 3684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 492 ms 3780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 3700 KB Output is correct
2 Incorrect 316 ms 3748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 3668 KB Output is correct
2 Incorrect 318 ms 3692 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 468 ms 3692 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 327 ms 3652 KB Output isn't correct
2 Halted 0 ms 0 KB -