123

<pre name="code" class="csharp">#include <stdio.h>#include <string.h>#include <stdlib.h>const int M=20000+5;int n,m;int dragon[M];int soilder[M];int cmp(const void *a,const void *b){return *((int *)a)-*((int *)b);}int main(){while(scanf("%d%d",&n,&m),!(!n&&!m)){for(int i=0;i<n;i++)scanf("%d",&dragon[i]);for(int i=0;i<m;i++)scanf("%d",&soilder[i]);qsort(dragon,n,sizeof(dragon[0]),cmp);qsort(soilder,m,sizeof(soilder[0]),cmp);int ans=0;int cnt=0;for(int i=0;i<m;i++){if(soilder[i]>=dragon[cnt])ans+=soilder[i],++cnt;if(cnt==n)break;}if(cnt==n)printf("%d\n",ans);elseputs("Loowater is doomed!");}return 0;}