UVa 11292 Spreading the Wealth 勇者斗恶龙

对恶龙的头和骑士的能力排一次序即可

代码:

#include<stdio.h>#include<math.h>#include<string.h>#include<algorithm>#include<limits.h>using namespace std;#define MAXSIZE 20005int a[MAXSIZE],b[MAXSIZE];int main(){int m,n;while(scanf("%d %d",&m,&n)!=EOF&&m+n){for(int i=1; i<= m; i++)scanf("%d",&a[i]);for(int i=1; i<= n; i++)scanf("%d",&b[i]);if(m> n)printf("Loowater is doomed!\n");else{sort(a+1,a+m+1);sort(b+1,b+n+1);int ans= 0;int t= 1,j= 1;while(j<= n&&t<= m){if(b[j]>= a[t]){ans+= b[j];//printf(": %d\n",b[j]);t++;j++;}elsej++;}if(t==m+1)printf("%d\n",ans);elseprintf("Loowater is doomed!\n");}}return 0;}