版权声明:本人菜鸟一只,如文章有错误或您有高见,请不吝赐教 https://blog.csdn.net/qq_41138935/article/details/83790881
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int arr[20005];
int brr[20005];
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)&&n&&m){
for(int i=0;i<n;i++) scanf("%d",&arr[i]);
for(int i=0;i<m;i++) scanf("%d",&brr[i]);
sort(arr,arr+n);
sort(brr,brr+m);
int cur=0; //需要砍掉头的编号
int cost=0; //费用
for(int i=0;i<m;i++)
if(brr[i]>=arr[cur]){
cost+=brr[i];
if(++cur==n) break;
}
if(cur>=n)
cout<<cost<<endl;
else
cout<<"Loowater is doomed!"<<endl;
}
return 0;
}