代码

#include<bits/stdc++.h>

using namespace std;

int n,m,ans,mins,maxs,id;
int sizes[20001];
int flag;

struct str
{
	int mon;
	bool dea=1;
}knig[20001];

int main()
{
	cin>>n>>m;
	for(int i=0;i<=n-1;i++)
	{
		cin>>sizes[i];
	}
	for(int i=0;i<=m-1;i++)
	{
		cin>>knig[i].mon;
		maxs=max(maxs,knig[i].mon);
	}
	for(int i=0;i<=n-1;i++)
	{
		mins=maxs;
		id=-1;
		for(int j=0;j<=m-1;j++)
		{
			if(knig[j].dea&&knig[j].mon>=sizes[i])
			{
				if(knig[j].mon<mins)
				{
					mins=knig[j].mon;
					id=j;
				}
			}
		}
		knig[id].dea=0;
		ans+=mins;
		if(id!=-1)
		{
			flag++;
		}
	}
	if(flag==n)
	{
		cout<<ans;
	}
	else
	{
		cout<<"you died!";
	}
	
	return 0;
}