Submission #102562

#	Time	Username	Problem	Language	Result	Execution time	Memory
102562		Ort	Simfonija (COCI19_simfonija)	C++11	110 / 110	47 ms	896 KiB

simfonija

#include<iostream>
#include<algorithm>
#define MAX 100020
#define ll long long
     
using namespace std;
     
int n, k, x, inc;
ll sol = 100000000000000000;
     
int a[MAX];
	     
int main() {
    cin.sync_with_stdio(0); cin.tie(0);
    cin.exceptions(cin.failbit);
    cin >> n >> x; k = n - x;
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<n;i++) {cin >> x; a[i]-=x;}
    sort(a, a+n);
    ll m = 0, c = 0, nc = 0, l, r;
    if(k%2) m = k / 2;
    else m = k / 2 - 1;
    int mv = a[m];
    for(int i=0;i<k;i++) c += abs(a[i]-mv);
    ll om = mv;
    sol = min(sol,c); inc++;
    for(int i=0;i<(n-k);i++) {
    	mv = a[m+inc]; inc++;
    	l = a[i]; r = a[i+k];
    	nc = c - (abs(om-l)) + (abs(mv-r));
    	if(k%2==0) nc -= (mv - om);
    	sol = min(sol,nc);
    	c = nc; om = mv;
    }
    cout << sol;
    return 0;
}

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