UVA 11292 - Dragon of Loowater

直接贪心，从小到大排序，然后比较就ok了

代码如下：

[cpp]
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int i,j;
const int N=20010;
typedef long long LL;

int a[N],b[N];
int n,m;

int main()
{
while(scanf("%d%d",&n,&m)&&(n+m)!=0)
{

for(i=0;i scanf("%d",&a[i]);
for(i=0;i scanf("%d",&b[i]);
sort(a,a+n);
sort(b,b+m);
int sum=0,cur=0;
for(i=0,j=0;i {
while(b[j] {
j++;
}
if(j>=m)
break;
if(b[j]>=a[i])
{
cur++;
sum+=b[j];
j++;
}
}
if(cur>=n)
printf("%d\n",sum);
else
printf("Loowater is doomed!\n");
}
return 0;
}

/*
2 3
5
4
7
8
4
2 1
5
5
10
0 0
*/

#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int i,j;
const int N=20010;
typedef long long LL;

int a[N],b[N];
int n,m;

int main()
{
while(scanf("%d%d",&n,&m)&&(n+m)!=0)
{

for(i=0;i scanf("%d",&a[i]);
for(i=0;i scanf("%d",&b[i]);
sort(a,a+n);
sort(b,b+m);
int sum=0,cur=0;
for(i=0,j=0;i {
while(b[j] {
j++;
}
if(j>=m)
break;
if(b[j]>=a[i])
{
cur++;
sum+=b[j];
j++;
}
}
if(cur>=n)
printf("%d\n",sum);
else
printf("Loowater is doomed!\n");
}
return 0;
}

/*
2 3
5
4
7
8
4
2 1
5
5
10
0 0
*/