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