全红,救救
查看原帖
全红,救救
1118104
eden369楼主2024/2/26 18:40
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct person {
    string num;
    int x;
} persons[21];
bool f(person a, person b)
{
    if (a.num.size() != b.num.size())
        return a.num.size()>b.num.size();
    else return a.num > b.num;
}
int main() {
    int n;
    string str;
    cin >> n;
    cin.ignore();
    for (int i=1;i <= n;i++)
    {
        getline(cin, persons[i].num);
        persons[i].x = i;
    }
    sort(persons+1, persons+1+n, f);
    cout << persons[1].x << endl;
    cout << persons[1].num<<endl;
    return 0;
}
2024/2/26 18:40
加载中...