#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int m, n; cin >> m >> n; vector<int> d(m), a(n); for (int i = 0; i < m; i++) cin >> d[i]; for (int i = 0; i < n; i++) cin >> a[i]; sort(d.begin(), d.end()); sort(a.begin(), a.end()); int i = 0, j = 0; while (i < m && j < n) { if (a[j] > d[i]) i++; j++; } long long res = 0; for (int k = j; k < n; k++) res += a[k]; cout << res << endl; return 0; }