POJ 3646 Dragon of Loowater

来源：互联网发布：php图书管理系统实例编辑：程序博客网时间：2024/06/07 00:04

UVa 11292 /poj 3646 /hdu 1902

贪心~ 水题！

太久没A题了，手生了，敲了半个小时。

#include <cstdio>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;int a[20005],b[20005];int main(){    //freopen("in.txt","r",stdin);    int n,m;    while(scanf("%d%d",&n,&m))    {        if ( n == 0 || m == 0 )            break;        for (int i=0;i<n;i++)            scanf("%d",&a[i]);        for (int i=0;i<m;i++)            scanf("%d",&b[i]);        if (n <= m){            sort(a,a+n);            sort(b,b+m);            int i=0,j=0;            int count=0;            int sum=0;            for ( ;j<m; )            {                if ( b[j] >= a[i] )                {                    count++;sum+=b[j];j++;                    if ( ++i == n) break;                }                else                    j++;            }            if ( count == n )                printf("%d\n",sum);            else                printf("Loowater is doomed!\n");        }        else            printf("Loowater is doomed!\n");    }}