超过一半的数题解

这是超过一半的数题解

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    int array[n];
    int tmp = 0;
    int count = 0;
    for (int i = 0; i < n; ++i) {
        cin >> array[i];
    }
    for (int j = 0; j < n; ++j) {
        for (int k = 0; k < n; ++k) {
            if (array[j] == array[k]) {
                ++count;
            }
        }
        if (count > n / 2) {
            if (array[j] != tmp) {
                cout << array[j] << " ";
            }
            tmp = array[j];

        }
        count = 0;
    }
    return 0;
}

包对的
give me a赞