-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathranking.cpp
More file actions
45 lines (45 loc) · 1.17 KB
/
Copy pathranking.cpp
File metadata and controls
45 lines (45 loc) · 1.17 KB
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
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int num;
cin>>num;
struct Ranking
{
string name;
int rating;
string title;
};
Ranking equation[100];
for (int i = 0; i < num; i++)
{
cin>>equation[i].name>>equation[i].rating;
if (1400<=equation[i].rating&&equation[i].rating<=1599)
{
equation[i].title="Specialist";
}
if (1600<=equation[i].rating&&equation[i].rating<=1899)
{
equation[i].title="Expert";
}
if (1900<=equation[i].rating&&equation[i].rating<=2299)
{
equation[i].title="Master";
}
if (2300<=equation[i].rating&&equation[i].rating<=2600)
{
equation[i].title="GrandMaster";
}
}
sort(equation, equation + num, [](const Ranking& r1, const Ranking& r2)
{
if (r1.rating != r2.rating) return r1.rating > r2.rating;
if (r1.title != r2.title) return r1.title < r2.title;
return r1.name < r2.name;
});
for (int i = 0; i < num; i++)
{
cout<<equation[i].name<<" "<<equation[i].rating<<" "<<equation[i].title<<endl;
}
}