蒟蒻求助40分(感觉思路ok)
查看原帖
蒟蒻求助40分(感觉思路ok)
559847
Ferm_Tawn楼主2022/7/24 19:29

用二分

#include<bits/stdc++.h>
using namespace std;
long long n , r = -1e18;
long long a[1000005] , b[1000005];
bool check(long long k){
	bool flag = true;
	for(long long i = 1 ; i <= n ; i++){
		if(a[i] == k && b[i] == k) flag = false;
	}
	return flag;
}
int main(){
	cin >> n;
	for(long long i = 1 ; i <= n ; i++){
		cin >> a[i];
		r = max(r , a[i]);
	} 
	for(long long i = 1 ; i <= n ; i++){
		cin >> b[i];
		r = max(r , b[i]);
	} 
	for(long long i = 0 ; i <= r + 1 ; i++){
		if(check(i) == true){
			cout << n - i;
			break;
		}
	}
	return 0;
} 
2022/7/24 19:29
加载中...