例題5-1 UVA 11292 The Dragon of Loowater勇者鬥惡龍

很簡單的一道題，輸入完騎士和惡龍後，sort排序，然後掃面騎士，發現騎士大于等于惡龍，費用就加，否則繼續循環，直到惡龍到n及時跳出循環：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 20000 + 5;
int Knight[maxn];
int Dragon[maxn];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m) && m && n){
        for (int i = 0; i < n; ++i)scanf("%d",&Dragon[i]);
        for (int i = 0; i < m; ++i)scanf("%d",&Knight[i]);
        sort(Dragon, Dragon + n);
        sort(Knight, Knight + m);
        int cost = 0,cur = 0;
        for (int i = 0; i < m; ++i){
            if (Knight[i] >= Dragon[cur]){
                cost += Knight[i];
                if (++cur == n)break;
            }
        }
        if (cur < n)printf("Loowater is doomed!\n");
        else printf("%d\n",cost);
    }
    return 0;
}