#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 20000+5;
int A[maxn],B[maxn];
int main()
{
int n,m;
while(scanf("%d%d",&n,&m) ==2 && n && m){
for(int i=0;i<n;i++)scanf("%d",&A[i]);
for(int i=0;i<m;i++)scanf("%d",&B[i]);
sort(A,A+n);
sort(B,B+m);
int cost=0,cur=0;
for(int i=0;i<m;i++){
if(A[cur]<=B[i]){
cost+=B[i];
if(++cur == n)break;//算法2.2
}
}
if(cur<n)printf("Loowater is doomed!\n");
else printf("%d\n",cost);
}
return 0;
}
勇者斗恶龙anwser
最新推荐文章于 2023-05-15 18:47:41 发布