70tle求调

#include<bits/stdc++.h>
using namespace std;
#define ll long long
map<ll,bool> g;
map<ll,bool> p;
ll h[200005];
ll y[200005];
ll v,o;
int main(){
	int a;
	cin>>a;
	for(int i=1;i<=a;i++){
		int k;
		cin>>k;
		if(g.count(k)==0){
			h[v]=k;
			v++;
			g[k]=1;
		}
	}
	sort(h,h+v);
	for(int i=0;i<v;i++){
		for(int j=0;j<i;j++){
			ll k=h[i]%h[j];
			if(p.count(k)==0){
				y[o]=k;
				o++;
				p[k]=1;
			}
		}
		if(i!=v-1){
			ll k=h[i];
			if(p.count(k)==0){
				y[o]=k;
				o++;
				p[k]=1;
			}
		}
	}
	if(o<2){
		cout<<"-1";
		return 0;
	}
	sort(y,y+o);
	cout<<y[o-2];
}