求问做法正确性

#include <bits/stdc++.h>
#define ll long long
#define endl "\n"

using namespace std;

ll n, a[114514], cnt[114514], tot[114514], ans = 0;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin>> n;
    for (ll i = 1; i <= n; i++) {
        cin >> a[i]; cnt[a[i]] ++, tot[a[i]] ++;
    }
    sort(a + 1, a + n + 1); ll sz = unique(a + 1, a + n + 1) - a - 1;
    for (ll i = 1; i <= sz; i++) {
        ll pos = i - 1;
        while (cnt[a[i]] >= 0 && pos >= 1) {
            if (cnt[a[i]] >= tot[a[pos]]) {
                cnt[a[i]] -= tot[a[pos]], tot[a[pos]] = cnt[a[pos]] = 0;
            } else {
                tot[a[pos]] -= cnt[a[i]], cnt[a[i]] = 0;
            }
            pos --;
        }
    }
    for (ll i = 1; i <= sz; i++) {
        ans += tot[a[i]];
    }
    cout << ans << endl;
}