Submission #159670

#	Time	Username	Problem	Language	Result	Execution time	Memory
159670		theknife2001	Simfonija (COCI19_simfonija)	C++17	0 / 110	302 ms	3220 KiB

simfonija

#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N=1e5+55;
int a[N];
int b[N];
ll x[N];
int n,k;
int pre;
int suf;
ll cur;
int j,i;

void solve(int pos)
{
	pre--;
	suf++;
	//cout<<pre<<' '<<suf<<endl;
	while(x[j]-x[pos]<x[pos]-x[i]&&i<pos&&j<n)
	{
		//cout<<' '<<i<<' '<<j<<endl;
		cur+=x[j]-x[pos-1];
		pre++;
		suf--;
		cur-=x[pos-1]-x[i];
		j--;
		i++;
	}
	//cout<<cur<<' ';
	ll dif=x[pos]-x[pos-1];
	cur+=dif*suf-dif*(pre+1);
	cout<<cur<<endl;
}
		
		

int main()
{
  	ios::sync_with_stdio(false);
	cin>>n>>k;
	for(int i=0;i<n;i++)
	cin>>a[i];
	for(int i=0;i<n;i++)
	cin>>b[i];
	for(int i=0;i<n;i++)
	x[i]=a[i]-b[i];
	sort(x,x+n);
	int temp=x[0];
	for(int i=0;i<n;i++)
	{
		x[i]-=temp;
		if(i<n-k)
		cur+=abs(x[i]);
	}
	j=n-k;
	ll ans=cur;
	pre=n-k-1;
	for(int i=1;i<n;i++)
	{
		solve(i);
		ans=min(ans,cur);
	}
	cout<<ans<<endl;
	return 0;
}

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