【洛谷-P1781】解题报告（排序）

原始题目

P1781 宇宙总统

题目大意

输出出现次数最多的编号

解题思路

排序

解题代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 5;

#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = n - 1; i >= a; --i)
#define fi first
#define se second
#define pb push_back
#define np next_permutation
#define mp make_pair
#define endl '\n'

struct node {
    string s;
    int id;
};
node a[maxn];

bool cmp(node a, node b)
{
    if (a.s.length() != b.s.length()) {
        return a.s.length() > b.s.length();
    } else {
        int len = a.s.length();
        rep(i, 0, len)
        {
            if (a.s[i] != b.s[i])
                return a.s[i] > b.s[i];
        }
    }
}
int n;
string ss;
int main()
{
    ios::sync_with_stdio(false);
    while (cin >> n) {
        rep(i, 1, n + 1)
        {
            cin >> ss;
            a[i].s = ss;
            a[i].id = i;
        }
        sort(a + 1, a + 1 + n, cmp);
        cout << a[1].id << endl
             << a[1].s << endl;
    }
}