#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)
using namespace std;
typedef long long ll;
typedef long double ld;
ll a[N], b[N], n, k;
ll calc(ll x)
{
ll sum = 0;
vector <ll> g; g.clear();
for (int i = 0; i < n; i++) g.pb(abs((a[i] + x) - b[i]));
sort(g.begin(), g.end());
int kk = k;
while (kk > 0)
{
kk--;
g.pop_back();
}
for (int i = 0; i < sz(g); i++) sum += g[i];
return sum;
}
int main()
{
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
int l = -1000000, r = 0;
int q = 0;
while (q < 40)
{
int mdl = l + (r - l) / 3;
int mdr = r - (r - l) / 3;
if (calc(mdl) > calc(mdr)) l = mdl; else r = mdr;
q++;
}
ll ans = 1e18;
for (int i = l; i <= r; i++) ans = min(ans, calc(i));
l = 0; r = 1000000;
int q = 0;
while (q < 40)
{
int mdl = l + (r - l) / 3;
int mdr = r - (r - l) / 3;
if (calc(mdl) > calc(mdr)) l = mdl; else r = mdr;
q++;
}
for (int i = l; i <= r; i++) ans = min(ans, calc(i));
cout << ans << endl;
}
Compilation message
simfonija.cpp: In function 'int main()':
simfonija.cpp:80:9: error: redeclaration of 'int q'
int q = 0;
^
simfonija.cpp:61:9: note: 'int q' previously declared here
int q = 0;
^
