oj.uz

Submission #159671

# Submission time Handle Problem Language Result Execution time Memory
159671 2019-10-23T20:46:48 Z theknife2001 Simfonija (COCI19_simfonija) C++17
44 / 110
 40 ms 2040 KB 
#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);
}
		
		

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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1912 KB Output is correct
2 Correct 35 ms 1936 KB Output is correct
3 Correct 33 ms 1912 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1912 KB Output is correct
2 Correct 35 ms 1904 KB Output is correct
3 Correct 33 ms 1880 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1956 KB Output is correct
2 Correct 35 ms 1912 KB Output is correct
3 Correct 33 ms 2040 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 1912 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 1824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1912 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 1912 KB Output isn't correct
2 Halted 0 ms 0 KB -