UVA 1192 Dragon of Loowater

---

【题目分析】
一道贪心的水题，处理好边界会十分简单。uva网站上的魔性配图也是6得飞起。

---

【代码】

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