DuongNhi99

MUAQUA

Nov 15th, 2021 (edited)
134
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.02 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. using ll = long long;
  5. using pi32 = pair<int, int>;
  6. using pi64 = pair<int64_t, int64_t>;
  7.  
  8. const int maxN = 1e5 + 5;
  9. const ll INF = 1e18 + 7;
  10. const int MOD = 998244353;
  11.  
  12. int n, m;
  13. ll a[maxN], b[maxN];
  14.  
  15. priority_queue<ll> d;
  16.  
  17. void solve() {
  18.     ll sum = 0;
  19.     for (int i = 1; i <= n; ++i)
  20.         sum += b[i];
  21.  
  22.     for (int i = 1; i <= n; ++i)
  23.         d.push(b[i] - a[i]);
  24.  
  25.     while (m--) {
  26.         sum -= d.top(); d.pop();
  27.     }
  28.  
  29.     ll ans = sum;
  30.     while (!d.empty()) {
  31.         sum -= d.top(); d.pop();
  32.         ans = min(ans, sum);
  33.     }
  34.  
  35.     cout << ans << '\n';
  36. }
  37.  
  38. int main() {
  39. #ifdef LOCAL
  40.     freopen("in1.txt", "r", stdin);
  41. #else
  42.     freopen("MUAQUA.inp", "r", stdin);
  43.     freopen("MUAQUA.out", "w", stdout);
  44. #endif
  45.     ios_base::sync_with_stdio(false);
  46.     cin.tie(nullptr);
  47.  
  48.     cin >> n >> m;
  49.     for (int i = 1; i <= n; ++i)
  50.         cin >> a[i];
  51.     for (int i = 1; i <= n; ++i)
  52.         cin >> b[i];
  53.  
  54.     solve();
  55.  
  56.     return 0;
  57. }
  58.  
Add Comment
Please, Sign In to add comment