Submission #8363993

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	int n ;
	cin>>n ;
	int arr[n] , arr2[n] ;
	for(int i = 0 ; i < n ; ++i)
		cin>>arr[i] ;
	for(int i = 0 ; i < n ; ++i)
		cin>>arr2[i] ;
	int cnt = 0 ;
	set< pair<int , int> >s ;
	set< pair<int , int> >::iterator it ;
	pair<int , int>p ;
	for(int i = 0 ; i < n ; ++i)
		s.insert({arr[i] , i}) ;
	for(int i = 0 ; i < n ; ++i)
	{
		if(cnt == n-2)
			break ;
		p = *s.begin() ;
		if(p.first > arr2[i])
			return cout<<"No\n" , 0 ;
		it = s.lower_bound({arr2[i]+1 , -1}) ;
		it-- ;
		p = *it ;
		if(p.first != arr[i])
		{
			cnt++ ;
			s.erase({arr[i] , i}) ;
			arr[p.second] = arr[i] ; 
			arr[i] = p.first ; 
			s.erase(p) ;
			s.insert({arr[p.second] , p.second}) ;
			continue ;
		}
		else
			s.erase({arr[i] , i}) ;
	}
	for(int i = 0 ; i < n ; ++i)
	{
		if(arr[i] > arr2[i])
			return cout<<"No\n" , 0 ;
	}
	return cout<<"Yes\n" , 0 ;
}

Submission Info

Judge Result