STL之map模板

最新推荐文章于 2024-01-17 16:38:06 发布

化十山

最新推荐文章于 2024-01-17 16:38:06 发布

阅读量364

点赞数 1

分类专栏： STL 文章标签： STL map

本文链接：https://blog.csdn.net/TJICSHAN/article/details/81210682

版权

STL 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目信息：

Given a number of strings, can you find how many strings that appears T times?

input:

The input contains multiple test cases. Each case begins with a integer N(the number of strings you will get, N<=100000), followed by N lines, each consists of a string.The length of each string won't longer than 20.

output:

For each test case: There will be several lines. Echo line print two integers T and M, separated by a space.

T represents the string appears T times, M represents there are M strings that echo string appears T times.

Don't print T or M if M <= 0. The output is ordered by T, from small to large.

Sample Input:

5
BBA
BBA
BEA
DEC
CCF

Sample Output:

1 3
2 1

Source:

ACM-ICPC黑龙江省第九届大学生程序设计竞赛选拔赛(2)

#include<stdio.h>
#include<algorithm>
#include<map>
#include<string>
#include<cstring>
using namespace std;
int ans[100005];
int main()
{
	int n;
	int i,j,k;
	char a[25];
	while(~scanf("%d",&n))
	{
		map<string,int>mp;
		map<string,int>::iterator it;
		memset(ans,0,sizeof(ans));
		for(i=1;i<=n;i++)
		{
			scanf("%s",a);
			mp[a]++;
		 } 
		 for(it=mp.begin();it!=mp.end();it++)
		 {
		 	int cnt=it->second;
		 	ans[cnt]++;
		 }
		 for(i=1;i<=n;i++)
		 {
		 	if(ans[i]!=0)
		 	printf("%d %d\n",i,ans[i]);
		 }
	}
	return 0;
}