oj.uz

Submission #169142

# Submission time Handle Problem Language Result Execution time Memory
169142 2019-12-18T15:42:00 Z egekabas Simfonija (COCI19_simfonija) C++14
0 / 110
 42 ms 5044 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n, k;
ll a[100009];
ll b[100009];
ll val[100009];;
ll pre[100009];
ll ans = 1e18;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
//    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n >> k;
    for(ll i = 1; i <= n; ++i)
        cin >> a[i];
    for(ll i = 1; i <= n; ++i)
        cin >> b[i];
    for(ll i = 1; i <= n; ++i)
        val[i] = (a[i]-b[i]);
    

    sort(val+1, val+1+n);
    for(ll i = 1; i <= n; ++i)
        pre[i] = val[i] + pre[i-1];    
    for(ll beg = 0; beg <= k; ++beg){
        ll fin = k-beg;
        ll sum = pre[n-fin]-pre[beg];
        ll av = sum/(n-k);    
        ll idx = upper_bound(val+1, val+1+n, av)-val;
        ll cur = ((pre[n-fin]-pre[idx-1]) - av*((n-fin)-(idx-1)));
        cur += av*(idx-1-beg)-(pre[idx-1]-pre[beg]);
        ans = min(ans, cur);
    }
    cout << ans << "\n";
}

Subtask #1
0 / 11.0

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

Subtask #1
0 / 11.0

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

Subtask #1
0 / 11.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 4856 KB Output is correct
2 Incorrect 34 ms 5044 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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