1098 岩洞施工 (20 分)

代码

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cctype>
#include <unordered_map>
#include <map>
using namespace std;
const int N = 1005;
int arr[N], brr[N]; 
typedef pair<int, string> PII;
int main(){
	int n, Min = 0x3f3f3f3f, Max = -0x3f3f3f3f;
	cin>>n; 
	for(int i = 0; i < n; i++){
		cin>>arr[i];
		Min = min(Min, arr[i]);
	}
	for(int i = 0; i < n; i++){
		cin>>brr[i];
		Max = max(Max, brr[i]);
	}
	if(Min > Max){
		cout<<"Yes "<< Min - Max<<endl;
	}else{
		cout<<"No "<< Max - Min + 1<<endl;
	}
	return 0;
}