Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- long long a[200005], b[200005], c[200005];
- int main()
- {
- long long n, m, k, i, j, sum=0;
- cin >> n >> k;
- for(i=0; i<n; i++)
- {
- scanf("%d", &a[i]);
- }
- for(i=0; i<n; i++)
- {
- scanf("%d", &b[i]);
- }
- long long cn = 0;
- for(i=0; i<n; i++)
- {
- c[i] = a[i]-b[i];
- if(c[i]<=0) cn++;
- }
- sort(c, c+n);
- for(i=0; i<n; i++)
- if(cn >k) k = cn;
- j = c[k-1];
- for(i=0; i<n; i++)
- {
- if( (a[i]-b[i] <= j) && k)
- {
- k--;
- sum += a[i];
- b[i] = 0;
- }
- }
- for(i=0; i<n; i++)
- {
- sum += b[i];
- }
- cout << sum << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement