题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2267
从新开始。书上例题自己实现的。。以后都这样。。
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n,m,knight[20001],ajatar[20001],ans=0,j=0;
A:while(scanf("%d%d",&n,&m)==2&&n&&m)
{
ans=0;j=0;
for(int i=0;i<n;i++)cin>>ajatar[i];
for(int i=0;i<m;i++)cin>>knight[i];
sort(knight,knight+m);
sort(ajatar,ajatar+n);
for(int i=0;i<n;i++)
{
while(knight[j]<ajatar[i])if(j<m)j++;else{
cout<<"Loowater is doomed!"<<endl;goto A;
};
ans+=knight[j++];
}
cout<<ans<<endl;;
}
return 0;
}