Uva 11292 Dragon of Loowater
算法竞赛 入门经典 训练指南 例题1
这题题意不用过多描述,反正也是水题一道,两个排序即可。
1 #include<cstdio> 2 #include<algorithm> 3 #include<cmath> 4 #include<iostream> 5 #include<cstring> 6 #include<string> 7 #include<queue> 8 9 using namespace std; 10 const int MAXN=20007; 11 12 int n,m; 13 int a[MAXN],b[MAXN]; 14 15 int main() 16 { 17 while (~scanf("%d%d",&n,&m)&&(n+m)) 18 { 19 for (int i=1;i<=n;i++) 20 scanf("%d",&a[i]); 21 for (int i=1;i<=m;i++) 22 scanf("%d",&b[i]); 23 sort(a+1,a+n+1); 24 sort(b+1,b+m+1); 25 26 int ans=0,i=1,j=1; 27 while (i<=n&&j<=m) 28 { 29 if (a[i]<=b[j]) 30 { 31 ans+=b[j]; 32 i++,j++; 33 } 34 else j++; 35 } 36 if (i>n) printf("%d\n",ans); 37 else printf("Loowater is doomed!\n"); 38 } 39 }