Translation D29 (with AC code POJ 27:mode of sequence)

“ Ctrl AC！ Together AC！”

The original title is ：Mode of Sequence

My translation ：

describe

Given a N Sequence of Numbers . Find the pattern in the sequence M, To cause to appear in a sequence M The largest number of .

Input

first line ： A positive integer N（N<=100）. The second line ：N A positive integer （<=100000）.

Output

An integer M.

AC Code ：

#include<bits/stdc++.h>
using namespace std;
map<int,int> mp;
bool cmp(pair<int,int> a,pair<int,int> b){
	return a.second>b.second;
}
int main(){
	int n;cin>>n;
	while(n--){
		int num;cin>>num;
		mp[num]++;
	}
	vector<pair<int,int>> vec(mp.begin(),mp.end());
	sort(vec.begin(),vec.end(),cmp);
	cout<<vec[0].first<<endl;
	return 0;
}

Thank you for reading ！！！

“ Ctrl AC！ Together AC！”