C++ 行讀入

來源:互聯網
上載者:User
View Code

#include<iostream>#include<string.h>#include<stdio.h>#include<algorithm>#include<map>#include<string>using namespace std;const int maxn=10000;int num[maxn];map<string,int>node1;map<int,string>node2;int main(){    int n;    while(scanf("%d",&n)!=EOF)    {        int pos=0;        int ans=0;        int id;        int test=1;        memset(num,0,sizeof(num));            string a;            getline(cin,a);            for(test=1;test<=n;test++)            {            getline(cin,a);            if(node1[a]==0)                node1[a]=++pos,node2[pos]=a;            num[node1[a]]++;            if(num[node1[a]]>ans)ans=num[node1[a]],id=node1[a];            }        cout<<node2[id]<<endl;    }    return 0;}
相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.