UVA11292（排序贪心）

笔者休息娱乐。

 const int maxn = 1e5 + ;
 int n, m, a;

 ll solve(int n, int m) {
     ll ans = ;
     priority_queue<int, vector<int>, greater<int>> dragon, knight;

     rep(i, , n) {
         read(a);
         dragon.push(a);
     }
     rep(i, , m) {
         read(a);
         knight.push(a);
     }

     if (m < n)  return -;
     while (true) {
         if (dragon.empty()) return ans;
         if (knight.empty()) return -;
         if (dragon.top() <= knight.top()) {
             dragon.pop();
             ans += knight.top();
             knight.pop();
         } else  knight.pop();
     }
 }

 int main() {
     while (~scanf("%d %d", &n, &m) && (n | m)) {
         ll k = solve(n, m);
         if (k >= ) writeln(k);
         else    puts("Loowater is doomed!");
     }
     return ;
 }