显示代码纯文本
#include <algorithm>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("DragonUVa.in");
ofstream fout ("DragonUVa.out");
int n,m,d[200100]={0},q[200100]={0},i,j,sum=0;
fin>>n>>m;
if(n>m)
{
fout<<"Loowater is doomed"<<endl;
return 0;
}
for (i=1;i<=n;i++)
fin>>d[i];
for (i=1;i<=m;i++)
fin>>q[i];
sort(d,d+n+1);
sort(q,q+m+1);
i=0;
j=0;
while (i<=n)
{
if (j>m&&i<=n)
{
fout<<"Loowater is doomed";
break;
}
if (q[j]>=d[i])
{
sum=sum+q[j];
j++;
i++;
}
else j++;
if (i>n)fout<<sum;
}
return 0;
}