Submission #44053773

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll MOD=998244353;
// head
const int N=2e5+5;
int a[N],b[N];
vector<int> V;
signed main() 
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	int n,m;cin>>n>>m;
	for(int i=0;i<n;i++) {cin>>a[i];V.pb(a[i]);}
	for(int j=0;j<m;j++) {cin>>b[j];V.pb(b[j]);}
	sort(all(V));
	sort(a,a+n);
	sort(b,b+m);
	int sum=0,now=0;
	int i=0,j=0;
	while(i!=n&&a[i]<=sum){
			i++;
		}
	while(j!=m&&b[j]<sum){
		j++;
	}
	if(i>=m-j+1){
		cout<<sum<<endl;
		return 0;
	}
	while(now<=n+m)
	{
		sum=V[now];
		while(i!=n&&a[i]<=sum){
			i++;
		}
		while(j!=m&&b[j]<sum){
			j++;
		}
		// int tmp;
		// if(j==m) tmp=0;
		// else tmp=m-j+1;
		if(i>=m-j){
			cout<<sum<<endl;
			return 0;
		}
		sum=V[now]+1;
		while(i!=n&&a[i]<=sum){
			i++;
		}
		while(j!=m&&b[j]<sum){
			//cout<<b[j]<<" "<<sum<<endl;
			j++;
		}
		//cout<<sum<<" "<<i<<" "<<j<<endl;
		// if(j==m) tmp=0;
		// else tmp=m-j+1;
		if(i>=m-j){
			cout<<sum<<endl;
			return 0;
		}
		now++;
	}
}

Submission Info

Judge Result