#include <iostream>
#include <algorithm>
#include <queue>
typedef long long ll;
using namespace std;
int main() //主函数
{
int n,m;
while(cin>>n>>m && n && m)
{
priority_queue<int,vector<int>,greater<int> > people,dragon;
for(int i=0;i<n;i++)
{
int t;
cin>>t;
dragon.push(t);
}
for(int i=0;i<m;i++)
{
int t;
cin>>t;
people.push(t);
}
int coin=0;
if (n>m)
{
cout<<"Loowater is doomed!"<<endl;
continue;
}
while(!dragon.empty() && ! people.empty())
{
int p=people.top();
int d=dragon.top();
if (p>=d)
{
coin+=p;
people.pop();
dragon.pop();
}
else people.pop();
}
if (dragon.empty())
cout<<coin<<endl;
else cout<<"Loowater is doomed!"<<endl;
}
}
scau算法 勇士斗恶龙
最新推荐文章于 2024-10-09 09:53:23 发布