#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 d = 0, a = 0; while (d < m && a < n) { if (atk[a] > def[d]) { d++; } a++; } long long sum = 0; for (int k = a; k < n; ++k) { sum += atk[k]; } cout << sum << endl; return 0; }