杭电OJ 1004 Let the Balloon Rise

关注

原创最新推荐文章于 2026-09-04 11:41:00 发布 247 阅读 AI 写同款· GEO 优化 ›

杭电OJ | 1004 Let the Balloon Rise 结构体数组排序 1004Let the Balloon Rise 笔记：用memset对整个结构体数组进行初始化如果结构体变量都是一致的，比如： struct person{ int age; int cost; }; person per[10]; memset(per,0,sizeof(person)*10); 但是不一致就像下面的代码一样逐一遍历吧，因为如果在结构体定义时就... 阅读详情

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 158371 Accepted Submission(s): 62950

Problem Description

Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.

This year, they decide to leave this lovely job to you.

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.

A test case with N = 0 terminates the input and this test case is not to be processed.

Output

For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

Sample Input

5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output

red
pink

Author

WU, Jiazhi

#include <iostream>
#include <cstring>
#include <string>
using namespace std;
#define MAX 1001
void getNum(int n);
int main()
{
	int n;
	while(cin>>n)
	{
		if(n==0)
		{
			break;	
		}	
		getNum(n);
	}
    return 0;
}
void getNum(int n) 
{
	int i,j;
	int ball[MAX];
	string balloon[MAX];
	memset(ball,0,sizeof(ball));
	for(i=1;i<=n;i++)
	{
		cin>>balloon[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			if(balloon[i]==balloon[j])
			{
				ball[i]++;
			}
		}
	}
	int maxNum,ret;
	ret=1;
	maxNum=ball[1];
	for(i=2;i<=n;i++)
	{
		if(ball[i]>maxNum)
		{
			maxNum=ball[i];
			ret=i;
		}
	}
	cout<<balloon[ret]<<endl;
}

收录于