#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++; } else { j++; } } // 剩下所有攻击 = 伤害 long long ans = 0; for (int k = j; k < n; k++) { ans += atk[k]; } cout << ans << endl; return 0; }