算法入门经典—— 01 勇士斗恶龙

题目： 

分析提示：

将输入的数字放进数组中，然后分别进行排序，比较大小。 

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std; 

const int maxn =  20000 + 5;
int A[maxn], B[maxn];

int main(int argc, char** argv) 
{
	int a, b;
	int pay = 0;
	int count = 0;
	
	while (scanf("%d %d", &a, &b) == 2 && a && b)
	{
		for (int i = 0; i < a; i++)
		{
			scanf("%d", &A[i]);
		}	
		for (int j = 0; j < b; j++)
		{
			scanf("%d", &B[j]);
		}
		
		sort(A, A+a);
		sort(B, B+b);
		
		for(int i = 0; i < a; i++)
		{
			if(A[i] <= B[i])
			{
				count += 1;
				pay += B[i];
				if(count == a)
				{
					break;
				}
			}			
		}
		if(count > b)
		{
			printf("Loowater is dommed!\n");
		}
		else
		{
			printf("%d", pay);
		}
	} 
	
	return 0;
}