#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int m, n; cin >> m >> n; vector<int> defense(m); vector<int> attack(n); for (int i = 0; i < m; i++) { cin >> defense[i]; } for (int i = 0; i < n; i++) { cin >> attack[i]; } sort(defense.begin(), defense.end()); sort(attack.begin(), attack.end()); int d = 0, a = 0; long long ans = 0; while (a < n) { // 还有防御没破，且当前攻击能破防 if (d < m && attack[a] > defense[d]) { d++; } else { // 破不了防 或者 防御已经全破，算伤害 ans += attack[a]; } a++; } cout << ans << endl; return 0; }