-
Notifications
You must be signed in to change notification settings - Fork 0
/
tempCodeRunnerFile.cpp
58 lines (49 loc) · 1.06 KB
/
tempCodeRunnerFile.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f(i, a, n) for (int i = (a); i <= (n); i++)
#define ff first
#define ss second
bool comp(pair<int, int> &a, pair<int, int> &b)
{
if (abs(a.first - a.second) == abs(b.first - b.second))
{
return a.first < b.first;
}
return abs(a.first - a.second) < abs(b.first - b.second);
}
bool check(ll n)
{
ll sq = sqrt(n);
return n == sq * sq;
}
void solve()
{
int n, k;
cin >> n >> k;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++)
cin >> v[i].ff;
for (int i = 0; i < n; i++)
cin >> v[i].ss;
sort(all(v), comp);
ll ans = 0;
for (int i = 0; i < k; i++)
ans += v[i].ff;
for (int i = k; i < n; i++)
ans += min(v[i].ff, v[i].ss);
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(9);
// int t;
// cin >> t;
// while (t--)
solve();
}