P2695 骑士的工作

#include<bits/stdc++.h>
using namespace std;
int n,m,size[1000000],big[1000000];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>size[i];
}
for(int i=1;i<=m;i++)
{
cin>>big[i];
}
sort(size+1,size+1+n);
sort(big+1,big+1+m);
if(big[m]<size[n])
{
cout<<"you died!";
exit(0);
}
int ans=0,i=1,j=1;
while(i<=n&&j<=m)
{
if(size[i]<=big[j])
{
ans+=big[j];
i++;j++;
}
else{
j++;
}
}
if(i==n+1)
{
cout<<ans;
}
else cout<<"you died!";
return 0;
}