这是代码

#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <iomanip>
#include <map>
#include <limits>
#define ll long long
#define un unsigned
#define ull unsigned long long
#define ld long doule
int n;
using namespace std;
int a[110000];
int b[110000];
int main(){
	int m;
	cin >>n >> m;
	int maxn,maxt;
	maxn=maxt=0;
	for(int i=1;i<=n;i++){
		cin >> a[i];
		maxn=max(maxn,a[i]);
	} 
	for(int i=1;i<=m;i++)
	{
		cin >> b[i];
		maxt=max(maxt,b[i]);
	}
	if(maxn>maxt||m<n){
		cout << "you died!\n";
		return 0;
	}
	sort(a+1,a+1+n);
	sort(b+1,b+1+m);
	int ans=0;
//	cout << "\n";
//	for(int i=1;i<=m;i++){
//		cout <<b[i]<< " ";
//	}
	//cout <<"\n";
	for(int i=1;i<=n;i++){
		
	//	cout << b[lower_bound(b+1,b+1+m,a[i])-b] << "\n";
		ans+=b[lower_bound(b+1,b+1+m,a[i]) - b];
	}
	cout <<ans;
}