Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <algorithm>
- using namespace std;
- typedef struct{
- int a, b;
- }obiect;
- int cmp_a(obiect x, obiect y)
- {
- if(x.a - x.b > y.a - y.b) return 0;
- return 1;
- }
- int main()
- {
- int n, k, i, rez;
- scanf("%d %d", &n, &k);
- obiect v[n];
- for(i = 0; i < n; ++i)
- {
- scanf("%d", &v[i].a);
- }
- for(i = 0; i < n; ++i)
- {
- scanf("%d", &v[i].b);
- }
- rez = 0;
- sort(v, v + n, cmp_a);
- for(i = 0; i < k || v[i].a - v[i].b < 0; ++i)
- {
- rez += v[i].a;
- }
- for(; i < n; ++i)
- {
- rez += v[i].b;
- }
- printf("%d\n", rez);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement