HDU-1902-The Dragon of Loowater

 1 #include <iostream>
 2 #include<stdio.h>
 3 #include<stdlib.h>
 4 #include<string.h>
 5 #include<algorithm>
 6 
 7 using namespace std;
 8 
 9 int nn[20010],mm[20010];
10 
11 bool cmp(int x,int y)
12 {
13 return x<y;
14 }
15 
16 int main()
17 {
18 int n,m,i,cur,sum,np,mp;
19 while(scanf("%d%d",&n,&m)!=EOF && n && m)
20 {
21 sum=0;
22 cur=0;
23 for(i=0; i<n; i++) scanf("%d",&nn[i]);
24 for(i=0; i<m; i++) scanf("%d",&mm[i]);
25 sort(nn,nn+n,cmp);
26 sort(mm,mm+m,cmp);
27 for(i=0; i<m; i++)
28 if(nn[cur]<=mm[i])
29 {
30 sum+=mm[i];
31 ++cur;
32 if(cur==n) break;
33 }
34 if(cur==n) printf("%d\n",sum);
35 else printf("Loowater is doomed!\n");
36 }
37 return 0;
38 }