Submission #4930847
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define reps(i,n) for(int i=1;i<=(n);++i) #define repr(i,n) for(int i=(n);i>=0;--i) #define int long long #define itn int #define pb push_back #define m_p make_pair #define m_t meke_tuple #define p_p(a,b) pb(m_p(a,b)) #define all(a) a.begin(),a.end() #define SORT(a) sort(all(a)) #define RSORT(a) sort(all(a));reverse(all(a)) #define UNIQUE(a) a.erase(unique(all(a)),a.end()) #define debg(a) cout<<#a<<" "<<a<<endl; #define call(a) for(auto i:a)cout<<i<<" ";cout<<endl #define out(a) cout<<(a)<<endl #define fi first #define se second #define Vec vector #define P pair typedef long long ll; typedef string str; typedef vector<ll> V; typedef pair<ll,ll> Pi; typedef vector<Pi> VP; const long long INF = 1LL<<60; const long long MOD = 1e9+7; int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);} int lcm(int a,int b){return a/gcd(a,b)*b;} int max(int a,int b){if(a>b)return a; return b;} int min(int a,int b){if(a>b)return b; return a;} void Yes(){cout<<"Yes"<<endl;} void No(){cout<<"No"<<endl;} void YN(bool b){cout<<(b?"Yes":"No")<<endl;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n; cin>>n; map<str,int> m; str a; rep(i,n)cin>>a,m[a]++; P<str,int>ans=m_p(a,m[a]); for(const auto&i:m){ if(i.se>ans.se)ans=i; } out(ans.fi); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | ate |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1608 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 2 ms | 256 KB |
case_02.txt | AC | 1 ms | 256 KB |
case_03.txt | AC | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 256 KB |
case_06.txt | AC | 1 ms | 256 KB |
case_07.txt | AC | 1 ms | 256 KB |
case_08.txt | AC | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | AC | 1 ms | 256 KB |
case_12.txt | AC | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 1 ms | 256 KB |
case_15.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |