This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 100005
int nArr, k;
int A[MAX], B[MAX];
int solve(int x){
int ans = INF;
vector<int> C(nArr + 5);
FOR(i, 1, nArr) C[i] = A[i] + x;
int sum = 0;
vector<int> store;
FOR(i, 1, nArr) sum += abs(B[i] - C[i]), store.push_back(abs(B[i] - C[i]));
sort(store.rbegin(), store.rend());
for (int i = 0; i < k; ++i) sum -= store[i];
return sum;
}
void process(void){
cin >> nArr >> k;
for (int i = 1; i <= nArr; ++i) cin >> A[i];
for (int i = 1; i <= nArr; ++i) cin >> B[i];
vector<int> x;
for (int i = 1; i <= nArr; ++i){
x.push_back(abs(B[i] - A[i]));
}
sort(x.begin(), x.end());
int ans = min(solve(x[nArr / 2]), solve(x[(nArr + 1) / 2]));
cout << ans;
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
}
Compilation message (stderr)
simfonija.cpp: In function 'long long int solve(long long int)':
simfonija.cpp:45:9: warning: unused variable 'ans' [-Wunused-variable]
45 | int ans = INF;
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |