-
Notifications
You must be signed in to change notification settings - Fork 0
/
1004.cpp
93 lines (93 loc) · 1.94 KB
/
1004.cpp
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
<<<<<<< HEAD
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 300005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
char ch = getchar(); ll s = 0, w = 1;
while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
return s * w;
}
inline void write(ll x)
{
if (x < 0)putchar('-'), x = -x;
if (x > 9)write(x / 10);
putchar(x % 10 + 48);
}
struct node
{
string a,b;
ll num;
}p[maxn];
inline bool cmp(const node &a,const node &b)
{
return a.num<b.num;
}
int main()
{
ll n=read();
for(rg i=1;i<=n;i++)
{
cin>>p[i].a>>p[i].b>>p[i].num;
}
sort(p+1,p+1+n,cmp);
cout<<p[n].a<<" "<<p[n].b<<endl<<p[1].a<<" "<<p[1].b<<endl;
return 0;
}
=======
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 300005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
char ch = getchar(); ll s = 0, w = 1;
while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
return s * w;
}
inline void write(ll x)
{
if (x < 0)putchar('-'), x = -x;
if (x > 9)write(x / 10);
putchar(x % 10 + 48);
}
struct node
{
string a,b;
ll num;
}p[maxn];
inline bool cmp(const node &a,const node &b)
{
return a.num<b.num;
}
int main()
{
ll n=read();
for(rg i=1;i<=n;i++)
{
cin>>p[i].a>>p[i].b>>p[i].num;
}
sort(p+1,p+1+n,cmp);
cout<<p[n].a<<" "<<p[n].b<<endl<<p[1].a<<" "<<p[1].b<<endl;
return 0;
}
>>>>>>> a45269a6f9ce61abed19a3dbc4d5ff91c7b4ed44