心中充满why

#include<bits/stdc++.h>
using namespace std;
int a,b[100005];
int main(){
	int duan=-100,chong=-100,n,js=0;
	int maxx=-100,minn=123456; 
	char huanhang;
	
	scanf("%d",&a);
	
	while(js!=a)
	{
		scanf("%d%c",&n,&huanhang);
		
		if(b[n]==n)
			chong=n;
		b[n]=n;
		
		maxx=max(b[n],maxx);
		minn=min(b[n],minn);
		
		if(huanhang=='\n')
			js++;
	}
	
	sort(b+minn,b+maxx+1);
	
	for(int j=minn;j<maxx;j++)
	{
		if((b[j]-b[j+1])==-2)
		{
			duan=b[j]+1;
			cout<<duan<<" "<<chong;
			break;
		}				
	}	
	return 0;
}