fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n, int k){
  34.  
  35. vector<int> diff(n);
  36.  
  37. int sum = 0;
  38. for(int i=0; i<n; i++){
  39. diff[i] = b[i] - a[i];
  40. sum += a[i];
  41. }
  42.  
  43. sort(begin(diff), end(diff), greater<int>());
  44.  
  45. k = n-k;
  46.  
  47. int i = 0;
  48. while(k>0){
  49. sum += diff[i];
  50. k--;
  51. i++;
  52. }
  53.  
  54. return sum;
  55.  
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68. int practice(int n, int k){
  69.  
  70.  
  71. return 0;
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n, k;
  81. cin>> n >> k;
  82.  
  83. a.resize(n);
  84. for(int i=0; i<n; i++) cin >> a[i];
  85.  
  86. b.resize(n);
  87. for(int i=0; i<n; i++) cin >> b[i];
  88.  
  89. cout << consistency(n, k) << endl;
  90.  
  91.  
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int32_t main() {
  99. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  100.  
  101. int t = 1;
  102. // cin >> t;
  103. while (t--) {
  104. solve();
  105. }
  106.  
  107. return 0;
  108. }
Success #stdin #stdout 0.01s 5324KB
stdin
5 3
6 4 3 2 1
8 8 7 3 3
stdout
24