hdu 1004 Let the Balloon Rise(STL)

1代码:

#include<set>
#include<string>
#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;

set<string> st;
multiset<string> mst;

int main()
{
    int n;
    string s;
    while(scanf("%d",&n)&&n)
    {
        st.clear();
        mst.clear();
        for(int i=0; i<n; i++)
        {
            cin>>s;
            st.insert(s);
            mst.insert(s);
        }
        set<string>::iterator it;
        int maxx=-1;
        for(it=st.begin(); it!=st.end(); it++)
        {
            int cnt=mst.count(*it);
            if(cnt>maxx)
            {
                maxx=cnt;
                s=*it;
            }
        }
        cout<<s<<endl;
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

时间: 2024-11-06 15:36:47

hdu 1004 Let the Balloon Rise(STL)的相关文章

HDU 1004 Let the Balloon Rise【STL&lt;map&gt;】

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 123800    Accepted Submission(s): 48826 Problem Description Contest time again! How excited it is to see balloons floating ar

HDU 1004 Let the Balloon Rise (map使用)

分析:题意简单,就用map的知识即可 #include <stdio.h> #include <iostream> #include <string.h> #include <map> using namespace std; int main() { int i,a,b,k; int N; char num[10]; while (~scanf("%d",&N)) { map<string,int> mp; whil

Let the Balloon Rise(水)

题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1004 Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 90295    Accepted Submission(s): 34294 Problem Description Contest time a

HDOJ 1004 - Let the Balloon Rise(让气球飞起来)

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 138223    Accepted Submission(s): 54591 Problem Description Contest time again! How excited it is to see balloons floating ar

hdu 1004 Let the Balloon Rise

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 80469    Accepted Submission(s): 30293 Problem Description Contest time again! How excited it is to see balloons floating aro

HDU 1004 Let the Balloon Rise map

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 104108    Accepted Submission(s): 40046 Problem Description Contest time again! How excited it is to see balloons floating ar

HDOJ 1004 Let the Balloon Rise (字符串+stl)

题目: 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 co

水题/hdu 1004 Let the Balloon Rise

题意 给出n个字符串,输出出现次数最多的那个 分析 存下字符串后排序,再统计,输出 Accepted Code 1 /* 2 PROBLEM:hdu1004 3 AUTHER:Nicole Lam 4 MEMO:水题 5 */ 6 7 #include<iostream> 8 #include<cstring> 9 #include<string> 10 #include<algorithm> 11 using namespace std; 12 13 in

hdu_1002_Let the Balloon Rise (模拟)

题意:输入n个气球的颜色,(气球的颜色是一个字符串,最多有15个小写字母),输出最多相同颜色气球的颜色,输入0结束程序. 保证每组数据都有唯一且具有最多的一种颜色的气球. 解题思路:利用string类型的数组保存n个气球的颜色 样例: 1)a  b  a d   e 2)a  b  a  d  e a->a  b  a  d  e b->a  b  a  d  e c->a  b  a  d  e d->a  b  a  d  e 1)中的每个元素与2)中的每个元素比较,相等则cn