#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++; } } // 如果没能破掉全部防御，伤害为0 if (i < m) { cout << 0 << endl; return 0; } // 破完了，剩下的攻击全部算伤害 long long damage = 0; for (int k = j; k < n; k++) { damage += atk[k]; } cout << damage << endl; return 0; }