Submission #100255

#	Time	Username	Problem	Language	Result	Execution time	Memory
100255		pzdba	Simfonija (COCI19_simfonija)	C++14	55 / 110	135 ms	2076 KiB

simfonija

#include <bits/stdc++.h>
using namespace std;
long long oo = 1e18;
int n, k;
int a[100001], b[100001], c[100001], d[100001];
long long solve(int x){
    for(int i=1;i<=n;i++) d[i] = c[i]+x;
    int l = 1, r = n, cnt = 0;
    while(cnt < k){
        cnt++;
        if(abs(d[l]) > abs(d[r])) d[l] = 0, l++;
        else d[r] = 0, r--;
    }
    long long ans = 0;
    for(int i=1;i<=n;i++) ans += abs(d[i]);
    return ans;
}
int main(){
    scanf("%d%d", &n, &k);
    for(int i=1;i<=n;i++) scanf("%d", &a[i]);
    for(int i=1;i<=n;i++) scanf("%d", &b[i]);
    for(int i=1;i<=n;i++) c[i] = a[i]-b[i];
    sort(c+1, c+1+n);
    int lo = -2000000, hi = 2000000;
    long long ans = oo;
    for(int i=0;i<100;i++){
        int mid1 = (lo*2+hi)/3;
        int mid2 = (lo+2*hi)/3;
        long long result1 = solve(mid1);
        long long result2 = solve(mid2);
        if(result1 < result2){
            ans = min(ans, result1);
            hi = mid2;
        }
        else{
            ans = min(ans, result2);
            lo = mid1;
        }
    }
    printf("%lld\n", ans);
}

Compilation message (stderr)

simfonija.cpp: In function 'int main()':
simfonija.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
simfonija.cpp:20:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d", &a[i]);
                           ~~~~~^~~~~~~~~~~~~
simfonija.cpp:21:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d", &b[i]);
                           ~~~~~^~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 11 / 11