sicily 1459 The Dragon of Loowater

排序+贪心

// Problem#: 1459// Submission#: 2720147// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include<cstdio>#include<algorithm>using namespace std;const int maxn =20010;int A[maxn];int B[maxn];int main(){    int n,m;    while(scanf("%d%d",&n,&m)==2&&n&&m)    {        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;        int 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);    }      return 0;}