11292 Dragon of Loowater

贪心的思想

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
    int n,m;
    while(cin >> n>>m && n && m){
        vector<int> heads(n),knights(m);
        for(int i = 0; i < n; i ++ ) cin >> heads[i];
        for(int i = 0; i < m; i ++ ) cin >> knights[i];
        sort(heads.begin(),heads.end());
        sort(knights.begin(),knights.end());
        int minGold = 0;
        int i,j = 0;
        for(i = 0; i < n && j < m; i ++){
            for(; j < m ; j ++ )
                if(knights[j] >= heads[i]) break;
            minGold +=knights[j++];
        }
        if(i < n) cout<<"Loowater is doomed!"<<endl;
        else cout<<minGold<<endl;
    }
    return 0;
}