给一个非空的单词列表，输出前n个出现次数最多的单词

给一个非空的单词列表，输出前n个出现次数最多的单词
返回的答案应该按单词出现频率由高到低排序，如果不同的单词有相同的出现频率，按字母顺序排序

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>

using namespace std;

class solution
{
public:
	class compare	//比较规则(仿函数)
	{
	public:
		bool operator()(const pair<string, int> & p1, const pair<string, int> & p2)
		{
			return (p1.second > p2.second) || ((p1.second == p2.second) && (p1.first < p2.first));
		}
	};
	
	vector<string> topWordFrequent(vector<string> & words, int n)
	{
		vector<string> vs(n);

		map<string, int> mp;

		for (auto & i : words)
		{
			mp[i]++;	//利用 map 统计出每个字符串出现的次数
		}

#if 0

		multiset<pair<string, int>, compare> mst(mp.begin(), mp.end());	//利用muliset按照我们规定的排序方法(compare)自动排序

		multiset<pair<string, int>, compare>::iterator msi = mst.begin();

		int i;
		for (i = 0; i < n; ++i)
		{
			vs[i] = msi->first;	//打印前n个的过程
			msi++;
		}

#else

		vector<pair<string, int>> vp(mp.begin(), mp.end());
		compare cp;

		sort(vp.begin(), vp.end(), cp);	//库里的排序函数，对于头文件 algorithm.h

		int i;
		for (i = 0; i < n; ++i)
		{
			vs[i] = vp[i].first;
		}

#endif
		return vs;
	}
};

int main()
{
	solution s;

	vector<string> v{ "wang", "zhang", "li", "zhao", "liu", "zhang", "li", "zhao", "liu", "zhao" };

	v = s.topWordFrequent(v, 5);

	for (auto & i : v)
	{
		cout << i << ' ';
	}

	cout << endl;
	
	system("pause");
	return 0;
}