3647207_wa.cc

北大大牛代码 1240道题的原代码 超级权威

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main() {
  int i, n, m, x;
  while (cin >> n >> m && n) {
    priority_queue<int, vector<int>, greater<int> > dh, kh;
    for (i = 0; i < n; i++) {cin >> x; dh.push(x);}
    for (i = 0; i < m; i++) {cin >> x; kh.push(x);}
    long cost = 0;
    while (dh.size()) {
      while (kh.size() && kh.top() < dh.top()) kh.pop();
      if (!kh.size()) goto fail;
      cost += kh.top();
      kh.pop(); dh.pop();
    }
    cout << cost << endl;
    continue;
fail:
    cout << "bit is doomed!" << endl;
  }
return  0;
}