CSP 201312-1 出现次数最多的数

201312-1 出现次数最多的数

#include
#include
using namespace std;
int narray[10001] = { 0 };
int main()
{
	int n;
	cin >> n;
	int *array = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> array[i];
		int temp = array[i];
		narray[temp]++;
	}
	int max = 0;//次数
	int num =array[0];
	for (int i = 0; i < 10001; i++)
	{
		if (narray[i] > max)
		{
			num = i;
			max = narray[i];
		}
	}
	cout << num << endl;
	delete[]array;
	return  0;
}