求c++程序设计 输入n个数，把出现次数最多的那个数找出来

#include <iostream>

using namespace std;

int main(int argc, char* argv[])
{
int n, i, j, k;
int *ia = NULL, *times = NULL, *visited = NULL, max;
cout << "输入数字的个数：" << endl;
cin >> n;

times = new int[n];
visited = new int[n];
ia = new int[n];
cout << "输入数字序列：" << endl;

for (i = 0; i < n; ++i)
{
cin >> ia[i];
visited[i] = 0;
times[i] = 1;
}

for (i = 0; i < n; ++i)
{
if (!visited[i])
{
for (j = i + 1; j < n; ++j)
{
if ((ia[i] == ia[j]) && !visited[j])
{
visited[j] = 1;
++times[i];
}
}
}

visited[i] = 1;
}

for (i = 0; i < n; ++i)
{
cout << times[i] << endl;
}

max = times[0];
k = 0;

for (i = 1;