提交超时
查看原帖
提交超时
677581
_Glassy_Sky_楼主2023/1/8 22:38
#include<bits/stdc++.h>
using namespace std;
int a[200005];
map<int, int> mp;
int main()
{
	int n, minn = 1500000000, maxx = 0;
	scanf("%d", &n);
	for(int i = 1; i <= n; i ++)
	{
		scanf("%d", &a[i]);
		mp[a[i]] ++;
		minn = min(minn, a[i]);
		maxx = max(maxx, a[i]);
	}
	for(int i = minn; i <= maxx; i ++)
		if(mp[i] != 0)
			printf("%d %d\n", i, mp[i]);
	return 0;
}
2023/1/8 22:38
加载中...