Submission #1584872
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
map<string, ll> cnt;
ll n; cin >> n;
rep(i, n) {
string name; cin >> name;
cnt[name]++;
}
vector<pair<ll, string>> v;
each(p, cnt) v.pb({p.second, p.first});
sort(all(v));
cout << v.back().second << endl;
}
Submission Info
Submission Time |
|
Task |
B - 投票 |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1583 Byte |
Status |
AC |
Exec Time |
1 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 |
1 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 |