#include <iostream> #include <algorithm> using namespace std; const int MAXN = 1005; int def[MAXN], atk[MAXN]; 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; } else { ++j; } } int ans = 0; if (i == M) { for (int k = j; k < N; ++k) ans += atk[k]; } cout << ans << endl; return 0; }