（玄关）有大佬知道这道题的思路怎么写吗

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n;
int a[1000005];
int p, q;
int ans;

int check() {
	int diff = 1;
	int t = a[1];
	for (int i = 1; i <= n; i++) {
		if (a[i] != t) {
			t = a[i];
			diff++;
		}
	}
	return diff;
}

signed main() {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	p = 1, q = n;
	while (check() >= 3) {
		for (int i = p; i <= n; i++) {
			if (a[i] > a[p]) {
				a[p] = a[i];
				break;
			}
		}
		ans++;
		if (check() < 3) {
			break;
		}
		for (int i = q; i >= 1; i--) {
			if (a[i] < a[q]) {
				a[q] = a[i];
				break;
			}
		}
		ans++;
		/*for (int i = 1; i <= n; i++) {
			cout << a[i] << " ";
		}
		cout << "\n";*/
	}
	int maxx = -1, minn = 1000001;
	for (int i = 1; i <= n; i++) {
		maxx = max(maxx, a[i]);
		minn = min(minn, a[i]);
	}
	cout << ans << " " << minn << " " << maxx;
	return 0;
}