#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int m, n; cin >> m >> n; vector<int> def(m); vector<int> atk(n); for (int i = 0; i < m; ++i) cin >> def[i]; for (int i = 0; i < n; ++i) cin >> atk[i]; sort(def.begin(), def.end()); sort(atk.begin(), atk.end()); int break_num = 0; int j = 0; for (int i = 0; i < n; ++i) { if (j < m && atk[i] > def[j]) { break_num++; j++; } } long long ans = 0; if (break_num >= m) { for (int i = n - 1; i >= m; --i) { ans += atk[i]; } } cout << ans << endl; return 0; }