0x00 Link
-
Source
-AtCoder
-
Tag
-芝士水题
-
Time
- ∗ * ∗
0x01 Source Code
//
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int N = 111;
struct A{
string s;
int age;
}in[N];
void solve() {
int n;
cin >> n;
int idx = 1;
for (int i = 1; i <= n; i++) {
string s;
int age;
cin >> s >> age;
in[i] = (A){s, age};
if (in[idx].age > in[i].age) idx = i;
}
for (int i = idx; i <= n; i++) cout << in[i].s << endl;
for (int i = 1; i < idx; i++) cout << in[i].s << endl;
}
signed main() {
IOS
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
0x10 Diagram
-
404
0x11 Reference
-
404
作者 | 乐意奥AI