众数问题

#include<iostream>

using namespace std;
int a[1000001];//用来存数字出现的次数

int main() {
    int max = 0;
    int s = 0;//存最大的数组下标
    int n;
    int number;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int k;
        cin >> k;
        a[k]++;
        if (s < k)
            s = k;
    }
    for (int i = 1; i <= s; i++) {
        if (max < a[i]) {
            max = a[i];
            number = i;
        }
    }
    cout << number << endl;
    cout << max << endl;
    return 0;
}