【CSP试题回顾】201503-2-数字排序（优化）

CSP-201503-2-数字排序

解题代码

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#define ll long long
using namespace std;

struct digit
{
	int num, times;
};
int n, t;

bool cmp(digit& a, digit& b)
{
	if (a.times == b.times)
	{
		return a.num < b.num;
	}
	return a.times > b.times;
}

int main() {
	cin >> n;
	vector<digit>list;
	for (size_t i = 0; i < n; i++)
	{
		cin >> t;
		bool find = 0;
		for (auto& it : list)
		{
			if (it.num == t)
			{
				it.times++;
				find = 1;
				break;
			}
		}
		if (!find)
		{
			list.push_back({ t,1 });
		}
	}
	sort(list.begin(), list.end(), cmp);
	for (auto& it : list)
	{
		cout << it.num << " " << it.times << endl;
	}
	return 0;
}