#include <iostream> #include <algorithm> using namespace std; const int MAX = 100005; int def[MAX]; int atk[MAX]; int main() { int m, n; cin >> m >> n; for (int i = 0; i < m; i++) { cin >> def[i]; } for (int i = 0; i < n; i++) { cin >> atk[i]; } sort(def, def + m); sort(atk, atk + n); int i = 0, j = 0; while (i < m && j < n) { if (atk[j] > def[i]) { i++; } j++; } long long ans = 0; for (int k = j; k < n; k++) { ans += atk[k]; } cout << ans << endl; return 0; }