Search is not available for this dataset
name stringlengths 2 112 | description stringlengths 29 13k | source int64 1 7 | difficulty int64 0 25 | solution stringlengths 7 983k | language stringclasses 4
values |
|---|---|---|---|---|---|
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
A = []
for n in range(N):
s,p = input().split(" ")
A.append([s,-int(p),n+1])
A.sort()
for a in A:
print(a[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
sp=[]
for i in range(n):
s,p=map(str,input().split())
sp.append([s,-int(p),i+1])
sp.sort()
for ans in sp:
print(ans[-1]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
using namespace std;
const int N=103;
string S[N];
int P[N],C[N];
bool cmp(int x,int y) {
return S[x]<S[y]||(S[x]==S[y]&&C[x]>C[y]);
}
int main() {
int n;
cin>>n;
For(i,1,n) cin>>S[i]>>C[i],P[i]=i;
sort(P+1,P+1+n,cmp);
For(i,1,n) printf("%d\n",P[i]);
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
class Main{
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
String[] s=new String[n];
int[] p=new int[n];
int[] ans=new int[n];
for(int i=0;i<n;i++){
s[i]=sc.next();
p[i]=sc.nextInt();
ans[i]=i+1;
}
int inttmp;
String strtmp;
for(int i=0;i<n;i++){
for(int j=1;j<n;j++){
if(s[j-1].compareTo(s[j])>0||(s[j-1].compareTo(s[j])==0&&p[j-1]<p[j])){
strtmp=s[j-1];
s[j-1]=s[j];
s[j]=strtmp;
inttmp=p[j-1];
p[j-1]=p[j];
p[j]=inttmp;
inttmp=ans[j-1];
ans[j-1]=ans[j];
ans[j]=inttmp;
}
}
}
for(int i=0;i<n;i++){
System.out.println(ans[i]);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int n,p; cin>>n;
vector<tuple<string,int,int>> v;
for(int i=1;i<=n;i++){cin>>s>>p; v.push_back(make_tuple(s,-p,i));}
sort(v.begin(),v.end());
for(auto& t:v) cout<<get<2>(t)<<endl;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
t=[]
for i in range(n):
x,y=input().split()
b=[x,-int(y),i+1]
t.append(b)
t.sort()
for a in t:
print(a[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, a;
vector<tuple<string, int, int> > v;
cin >> n;
for (int i = 1; i<=n; ++i) {
cin >> s >> a;
v.emplace_back(s, -a, i);
}
sort(v.begin(), v.end());
for (int i = 0; i<n; ++i) {
cout << get<2>(v[i]) << endl;
}
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
P = [input().split()+[i+1] for i in range(N)]
P.sort(key=lambda x: (x[0], -int(x[1]), x[2]))
for _, _, i in P:
print(i) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Restaurant> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
String city = sc.next();
int score = Integer.parseInt(sc.next());
list.add(new Restaurant(city, score, i + 1));
}
Collections.sort(list);
list.stream().forEach(System.out::println);
}
}
class Restaurant implements Comparable<Restaurant> {
String city;
int score;
int index;
public Restaurant(String city, int score, int index) {
this.city = city;
this.score = score;
this.index = index;
}
@Override
public String toString() {
return Integer.toString(index);
}
@Override
public int compareTo(Restaurant o) {
int i = this.city.compareTo(o.city);
if (i == 0)
i = o.score - this.score;
return i;
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;cin>>n;
vector <pair< pair<string,int>,int> > v(n);
for(int i=0;i<n;i++){
string s;int a;
cin>>s>>a;
v[i]=make_pair(make_pair(s,-a),i);
}
sort(v.begin(),v.end());
for(int i=0;i<n;i++){
cout<<v[i].second+1<<endl;
}
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
using tsii=tuple<string,int,int>;
vector<tsii> vec(N);
for(int i=0;i<N;i++){
int P;
string S;
cin >> S >> P;
vec.at(i)=make_tuple(S,100-P,i);
}
sort(vec.begin(),vec.end());
for(tsii i:vec)
cout << get<2>(i)+1 << endl;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
a = []
for i in range(n):
s, p = input().split()
a += [(s, -int(p), i + 1)]
a.sort()
{print(t[2]) for t in a} | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
scan.nextLine();
String S;
String[] sArray;
String[][] sArray2 = new String[N][2];
Set<String> key = new TreeSet<>();
for (int i = 0; i < N; i++) {
S = scan.nextLine();
sArray = S.split(" ");
sArray2[i][0] = sArray[0];
sArray2[i][1] = sArray[1];
key.add(sArray[0]);
}
Map<Integer, Integer> map = new TreeMap<>(new Comparator<Integer>() {
public int compare(Integer k1, Integer k2) {
return k2.compareTo(k1) ;
}
});
for (String k : key) {
for (int i = 0; i < N; i++) {
if (k.equals(sArray2[i][0])) {
map.put(Integer.parseInt(sArray2[i][1]), i + 1);
}
}
for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
System.out.println(entry.getValue());
}
map.clear();
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
final Scanner sc = new Scanner(System.in);
final int n = sc.nextInt();
final Map<String, Map<Integer, Integer>> v = new TreeMap<>();
for (int i = 0; i < n; i++) {
final String s = sc.next();
final int p = sc.nextInt();
if (!v.containsKey(s)) {
v.put(s, new TreeMap<>(Comparator.reverseOrder()));
}
v.get(s).put(p, i+1);
}
for (final Map.Entry<String, Map<Integer, Integer>> e : v.entrySet()) {
for (Map.Entry<Integer, Integer> e2 : e.getValue().entrySet()) {
System.out.println(e2.getValue());
}
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main implements Comparable<Main> {
int no;
String name;
Main(int no, String name) {
this.no = no;
this.name = name;
}
public int compareTo(Main main) {
int ret = this.name.compareTo(main.name);
if (ret != 0) {
return ret;
}
return Integer.compare(this.no, main.no) * -1;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
List<Main> main = new ArrayList<>();
int[] point = new int[N];
for(int i = 0; i < N; i++) {
String str = sc.next();
int n = sc.nextInt();
main.add(new Main(n, str));
point[i] = n;
}
Collections.sort(main);
for(Main m : main) {
for(int i = 0; i < N; i++) {
if(point[i] == m.no) {
System.out.println(i + 1);
break;
}
}
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Restaurant[] restAry = new Restaurant[n];
for(int i = 0; i < n; i++){
String s = sc.next();
int p = sc.nextInt();
restAry[i] = new Restaurant(i + 1, s, p);
}
Arrays.sort(restAry);
for(Restaurant rest : restAry){
rest.printNum();
}
}
}
class Restaurant implements Comparable<Restaurant>{
int num;
String cityName;
int point;
Restaurant(int n, String s, int p){
num = n;
cityName = s;
point = p;
}
@Override
public int compareTo(Restaurant rest) {
int ret = this.cityName.compareTo(rest.cityName);
if(ret != 0){
return ret;
}
return Integer.compare(this.point, rest.point) * -1;
}
void printNum(){
System.out.println(this.num);
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
l=[]
for i in range(n):
s,p=input().split()
p=-int(p)
l.append([s,p,i+1])
l.sort()
for i in l:
print(i[-1]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
class Main {
public static void main(String args[]) {
StringBuilder sb = new StringBuilder();
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
List<rank> l = new ArrayList<>(n);
for (int i = 1; i <= n; i++) {
l.add(new rank(i, sc.next(), sc.nextInt()));
}
Collections.sort(l);
for (int i = 0; i < n; i++) {
System.out.println(l.get(i));
}
}
}
class rank implements Comparable<rank> {
int num;
String city;
int point;
rank(int n, String s, int p) {
num = n;
city = s;
point = p;
}
@Override
public int compareTo(rank o) {
if (city.compareTo(o.city) != 0) {
return city.compareTo(o.city);
}
return o.point - point;
}
public String toString() {
return String.valueOf(num);
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
string s;
pair<pair<string,ll>,ll> res[105];
ll N,num;
cin>>N;
for(ll i=0;i<N;i++){
cin>>s>>num;
res[i]=make_pair(make_pair(s,-num),i);
}
sort(res,res+N);
for(ll i=0;i<N;i++){
cout<<res[i].second+1<<endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
struct fck
{
string c;int v,id;
bool operator<(const fck&x)const
{
return c==x.c?(v>x.v):c<x.c;
}
}a[101];
int main()
{
int n,i;cin>>n;
for (i=1;i<=n;i++) cin>>a[i].c,cin>>a[i].v,a[i].id=i;
sort(a+1,a+n+1);for (i=1;i<=n;i++) cout<<a[i].id<<endl;
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.io.InputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class Main {
InputStream in = System.in;
PrintStream out = System.out;
public void _main(String[] args) {
Scanner sc = new Scanner(in);
int N = sc.nextInt();
List<List<Object>> sp = new ArrayList<>();
for(int i=1;i<=N;i++) {
sp.add(Arrays.asList(sc.next(), sc.nextInt(),i));
}
sp.sort(new Comparator<List<Object>>() {
@Override
public int compare(List<Object> o1, List<Object> o2) {
int x = ((String)o1.get(0)).compareTo((String)o2.get(0));
if(x != 0) {
return x;
}
return Integer.compare((Integer)o2.get(1), (Integer)o1.get(1));
}
});
sc.close();
for(List<Object> l : sp) {
out.println(l.get(2));
}
}
public static void main(String[] args) {
new Main()._main(args);
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(raw_input())
checck = {}
for i in xrange(n):
s,p=map(str,raw_input().split())
p=int(p)
if s in checck:
checck[s].append((p,i))
else:
checck.update({s:[(p,i)]})
check=list(checck)
check=sorted(check)
#print check
for i in check:
l=checck[i]
l=sorted(l)
for j in xrange(len(l)-1,-1,-1):
print l[j][1]+1
| PYTHON |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i;
cin >> n;
vector<pair<string,int>> s(n);
for(i=0; i<n; i++){
cin >> s[i].first >> s[i].second;
s[i].second=(100-s[i].second)*1000+(i+1);
}
sort(s.begin(), s.end());
for(i=0; i<n; i++){
cout << s[i].second%1000 << endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
map<string, set<pair<int,int> > > lo;
int n; cin >> n;
for(int i = 0; i < n; i++){
string p; int v;
cin >> p >> v;
lo[p].insert({-v, i});
}
for(auto it : lo){
for(auto ic : it.second){
cout << ic.second + 1 << endl;
}
}
return 0;
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, P;
string S;
vector<pair<pair<string, int>, int> > PP;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S >> P;
PP.push_back({ { S, 1000 - P }, i + 1 });
}
sort(PP.begin(), PP.end());
for (int i = 0; i < N; i++) {
cout << PP[i].second << endl;
}
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[] list = new String[n];
for (int i = 0; i < n; i++) {
list[i] = sc.next() + (1100 - sc.nextInt()) + "_" + (i + 1);
}
Arrays.sort(list);
for (String lis : list) {
String[] li = lis.split("_");
System.out.println(li[1]);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String[] sp = new String[n];
for (int i = 0; i < n; i++) {
String city = scan.next();
int point = scan.nextInt();
sp[i] = city + "," + (1100 - point) + "," + (i+1);
}
scan.close();
Arrays.sort(sp);
for (String s: sp) {
String ans = s.split(",")[2];
System.out.println(ans);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 |
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
class Restaurant implements Comparable<Restaurant> {
String city;
int point;
int i;
public Restaurant(String city, int point, int i) {
this.city = city;
this.point = point;
this.i = i;
}
public int compareTo(Restaurant other) {
int ans = city.compareTo(other.city);
if (ans != 0)
return ans;
return Integer.compare(other.point, point);
}
}
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<Restaurant> list = new ArrayList<Restaurant>();
int n = sc.nextInt();
for (int i = 1; i <= n; i++) {
String city = sc.next();
int point = sc.nextInt();
list.add(new Restaurant(city, point, i));
}
Collections.sort(list);
for (Restaurant restaulant : list) {
System.out.println(restaulant.i);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
d=[]
for i in range(n):
s,p=input().split()
d.append((s,100-int(p),i+1))
d.sort()
for i in range(n):
print(d[i][2])
| PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<tuple<string,int,int>> a;
for(int i=1;i<=N;i++){
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(tie(s,p,i));
}
sort(a.begin(),a.end());
for(int i=0;i<N;i++){
cout << get<2>(a[i]) <<endl;
}
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | a = range(1, int(input())+1)
b = sorted(a, key=lambda _:[(s, -int(p)) for s, p in[input().split()]])
print(*b) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
a = []
for i in range(N):
S, P = input().split()
a.append((S, -int(P), i + 1))
a.sort()
for _, _, i in a:
print(i) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<pair<string,int>,int>> A(N);
string S;
int P;
for(int i=0;i<N;i++){
cin>>S;
cin>>P;
A[i]={{S,100-P},i+1};
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
cout<<A[i].second<<endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
String[] city = new String[n];
int[] point = new int[n];
ArrayList<Integer> result = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
result.add(1);
}
for (int i = 0; i < n; i++) {
city[i] = sc.next();
point[i] = Integer.parseInt(sc.next());
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) {
continue;
}
if (city[i].compareTo(city[j]) < 0) {
result.set(j, result.get(j) + 1);
} else if (city[i].compareTo(city[j]) == 0) {
if (point[i] > point[j]) {
result.set(j, result.get(j) + 1);
}
}
}
}
for (int i = 0; i < n; i++) {
System.out.println(result.indexOf(i + 1) + 1);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int [] in = new int [a];
String [] str = new String [a];
int [] b = new int [a];
for(int i=0;i<a;i++){str[i] = sc.next();
in[i] = sc.nextInt();
}
for(int i=0;i<a;i++){int ans = 0;
for(int j=0;j<a;j++){
if((str[i]).compareTo(str[j])>0){ans++;}
if(str[i].equals(str[j])&&in[i]<in[j]){ans++;}
}
b[ans]=i+1;
}
for(int i=0;i<a;i++){System.out.println(b[i]);}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | for i in sorted(range(int(input())),key=lambda _:[(s,-int(p))for s,p in[input().split()]]):print(i+1) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
a = []
for i in range(n):
s, p = input().split()
a.append([s,-int(p),i])
a.sort()
for i in a:
print(i[-1]+1) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
SP=[list(input().split()) +[i] for i in range(n)]
SP.sort(key=lambda x: (x[0],-int(x[1])))
for i ,j ,k in SP:
print(k+1)
| PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Restaurant> list = new ArrayList();
for(int i = 1; i <= n; i++){
Restaurant r = new Restaurant(i, sc.next(), Integer.parseInt(sc.next()));
list.add(r);
}
list.sort((o1, o2) -> o2.point - o1.point);
list.sort((o1, o2) -> o1.city.compareTo(o2.city));
for(int i = 0; i < n; i++){
System.out.println(list.get(i).id);
}
}
}
class Restaurant {
int id;
String city;
int point;
Restaurant(int id, String city, int point){
this.id = id;
this.city = city;
this.point = point;
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<tuple<string, int, int>> a(N);
string c;
int p;
for (int i=0; i<N; i++){
cin >> c >> p;
a.at(i) = make_tuple(c, -p, i+1);
}
sort(a.begin(), a.end());
for (int i=0; i<N; i++){
cout << get<2>(a.at(i)) << endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.PriorityQueue;
import java.util.Scanner;
class MyClass implements Comparable<MyClass>{
String s;int p;
int i;
@Override
public int compareTo( MyClass o ){
return this.s.compareTo(o.s)*100-Integer.compare(this.p,o.p);
}
}
public class Main {
//B Guidebook
public static void main(String[] args){
int N;
Scanner sc = new Scanner(System.in);
N=sc.nextInt();
String[]S=new String[N];
int []P=new int[N];
PriorityQueue<MyClass> q=new PriorityQueue<MyClass>();
for(int i=1;i<=N;i++) {
MyClass m=new MyClass();
m.s=sc.next();
m.p=sc.nextInt();
m.i=i;
q.add(m);
}
for(;!q.isEmpty();) {
MyClass m=q.poll();
System.out.println(m.i);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author 9080384
*/
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
ArrayList<String> rest_list = new ArrayList<String>();
int rest_num = sc.nextInt();
StringBuilder sb;
for (int i = 0; i < rest_num; i++) {
sb = new StringBuilder();
sb.append(sc.next());
sb.append(-1*sc.nextInt()+1100);
sb.append("_");
sb.append(i+1);
rest_list.add(sb.toString());
}
Collections.sort(rest_list);
for(String obj : rest_list) {
System.out.println(obj.split("_")[1]);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
a = []
for i in range(1, n + 1):
s, p = input().split()
a.append((s, -int(p), i))
a.sort()
for i in a:
print(i[2])
| PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for(int i=0; i<N; i++){
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a,-b,i+1);
}
sort(p.begin(),p.end());
for(int i=0; i<N; i++){
cout << get<2>(p.at(i)) << endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | A=[]
p = int(input())
for i in range(p):
j,k = input().split()
A.append([j,-int(k),i+1])
A = sorted(A)
for j,k,l in A:
print(l) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
data=[]
for _ in range(n):
s,p=input().split()
data+=[[s,-1*int(p),_+1]]
data.sort()
for eata in data:
print(eata[2])
| PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
A=[]
for i in range(1,n+1):
S,P=input().split()
A.append((S,-int(P),i))
B=sorted(A)
for f in range(n):
print(B[f][2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | _, *sp = open(0).read().split()
for a in sorted([(s, -int(p), i + 1) for i, (s, p) in enumerate(zip(*[iter(sp)] * 2))]):
print(a[2])
| PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
pair<pair<string,int>,int> p[110];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
string s;
int x;
cin>>s>>x;
p[i]=make_pair(make_pair(s,-x),i);
}
sort(p,p+n);
for(int i=0;i<n;i++)
cout<<p[i].second+1<<endl;
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.time.Instant;
import java.util.*;
import java.util.function.ToLongFunction;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
List<Pair<String, Integer>> SP = new ArrayList<>();
for(int i=0; i<N; i++){
SP.add(new Pair<String, Integer>(i+1, sc.next(),sc.nextInt()));
}
Comparator<Pair> comparator = Comparator.<Pair, String> comparing(pair -> (String)pair.a)
.<Integer>thenComparing(pair -> -1 * (int)pair.b);
SP = SP.stream().sorted(comparator).collect(Collectors.toList());
for(Pair pair : SP){
System.out.println(pair.n);
}
}
static class Pair<T1, T2> {
int n;
T1 a;
T2 b;
public Pair(int n, T1 a,T2 b) {
this.n = n;
this.a = a;
this.b = b;
}
T1 getA(){
return a;
}
T2 getB(){
return b;
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
import java.util.AbstractMap.SimpleEntry;
public class Main {
// static final int modnum = 1e9 + 7;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
// sc.next();
String[] list = new String[N];
for (int i = 0; i < N; i++) {
String next = sc.next();
// System.out.println(next);
int nextInt = sc.nextInt();
// System.out.println(next+" "+nextInt);
list[i] = next+" "+(200-nextInt)+" "+(i+1);
// sc.next();
}
Arrays.sort(list, Comparator.naturalOrder());
for (int i = 0; i < N; i++) {
// System.out.println(list[i]);
System.out.println(list[i].split(" ")[list[i].split(" ").length-1]);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
l = []
for i in range(n):
a, b = input().split()
l.append((a, -int(b), i + 1))
l.sort()
for e in l:
print(e[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
vector<pair<pair<string,int>,int>> sp(n);
for(int i=0; i<n; ++i){
string s; int p; cin>>s>>p;
sp[i]=make_pair(make_pair(s,100-p), i+1);
}
sort(sp.begin(),sp.end());
for(int i=0; i<n; ++i)cout<<sp[i].second<<endl;
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.HashMap;
import java.util.Scanner;
import java.util.SortedSet;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner((System.in));
int n = sc.nextInt();
SortedSet<KeyValuePair> a = new TreeSet<KeyValuePair>();
HashMap<Integer, Integer> num = new HashMap<Integer, Integer>();
for (int i = 1; i <= n; i++) {
String str = sc.next();
int z = sc.nextInt() * (-1);
a.add(new KeyValuePair(z, str));
num.put(z, i);
// System.out.println(str + " " + z + " " + i);
}
for (KeyValuePair keyValuePair : a) {
System.out.println(num.get(keyValuePair.key));
}
sc.close();
}
}
class KeyValuePair implements Comparable<KeyValuePair> {
int key;
String value;
public KeyValuePair(int key, String value) {
super();
this.key = key;
this.value = value;
}
public int compareTo(KeyValuePair o) {
return value.equals(o.value) ? key - o.key : value.compareTo(o.value);
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
x=[]
for i in range(N):
s,p = input().split()
p=int(p)
x.append((s,-p,i+1))
x.sort()
for i in range(N):
print(x[i][2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
Obj[] objs = new Obj[N];
for (int i = 0; i < N; i++) {
objs[i] = new Obj(scanner.next(), scanner.nextInt(), i);
}
Arrays.sort(objs);
for (Obj obj : objs) {
System.out.println(obj.num + 1);
}
}
public static class Obj implements Comparable<Obj> {
String name;
int p;
int num;
public Obj(String name, int p, int num) {
this.name = name;
this.p = p;
this.num = num;
}
@Override
public int compareTo(Obj o) {
if (this.name.compareTo(o.name) == 0) {
return -Integer.compare(this.p, o.p);
} else {
return this.name.compareTo(o.name);
}
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 |
def main():
n = input()
sp = []
for i in xrange(n):
s, p = raw_input().split()
sp.append([s, -int(p), i + 1])
sp.sort()
for _, _, i in sp:
print i
if __name__ == '__main__':
main()
| PYTHON |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[] s=new String[n];
for(int i = 0;i<n;i++){
String ss = sc.next();
int num = sc.nextInt();
int num2 = i+1;
//S[i]が同じ文字列だった場合、昇順ソート後の値でnumを比較するため
s[i] = ss + " " + 1/(double)num + " " + num2;
}
Arrays.sort(s);
for(String j:s){
System.out.println(j.split(" ")[2]);
}
sc.close();
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] moo) throws Exception {
Scanner file = new Scanner(System.in);
int n = file.nextInt();
Moo[] m = new Moo[n];
for (int i = 0; i < n; i++) {
m[i] = new Moo(i + 1, file.next(), file.nextInt());
}
Arrays.sort(m);
for (int i = 0; i < n; i++) {
System.out.println(m[i].id);
}
file.close();
System.exit(0);
}
public static class Moo implements Comparable<Moo> {
int id, score;
String name;
public Moo(int id, String name, int score) {
this.id = id;
this.name = name;
this.score = score;
}
public int compareTo(Moo o) {
int c = name.compareTo(o.name);
if (c == 0) {
return -Integer.compare(score, o.score);
}
return c;
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<pair<pair<string,int>,int>>v(n);
for (int i=0;i<n;i++)
{
string s;
int p;
cin>>s>>p;
v[i]={{s,-p},i+1};
}
sort(v.begin(),v.end());
for(int i=0;i<n;i++)
cout<<v[i].second<<endl;
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
List<String> city = new ArrayList<>();
List<String> city_sorted = new ArrayList<>();
for(int i=0;i<n;i++) {
String s = in.next();
int p = 100 - in.nextInt();
if(p<10) {
city.add(s + "00" + p);
city_sorted.add(s + "00" + p);
}
else if(p<100) {
city.add(s + "0" + p);
city_sorted.add(s + "0" + p);
}
else {
city.add(s + p);
city_sorted.add(s + p);
}
}
Collections.sort(city_sorted);
for(int i=0;i<n;i++) {
String s = city_sorted.get(i);
for(int j=0;j<n;j++) {
if(s.equals(city.get(j))) {
System.out.println(j+1);
break;
}
}
}
in.close();
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String... args) {
// 入力
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[][] s = new String[n][3];
for (int i = 0; i < n; i++) {
s[i][0] = String.valueOf(i + 1);
s[i][1] = sc.next();
s[i][2] = sc.next();
}
Arrays.sort(s, (a, b) -> {
if (a[1].equals(b[1])) return Integer.parseInt(b[2]) - Integer.parseInt(a[2]);
return a[1].compareTo(b[1]);
});
for (int i=0;i<n;i++) {
System.out.println(s[i][0]);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | //besmellah
#include <bits/stdc++.h>
using namespace std;
set <tuple <string, int, int>> S;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++){
string s;
int p;
cin >> s >> p;
S.insert(make_tuple(s, -1 * p, i + 1));
}
for (auto s: S){
cout << get<2>(s) << '\n';
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String[] S = new String[N];
for (int i = 0; i < N; i++) {
S[i] = sc.next() + "/" + (1100 - sc.nextInt() + "/" + (i + 1));
}
sc.close();
Arrays.sort(S);
for (int i = 0; i < N; i++) {
String[] s_ = S[i].split("/");
System.out.println(s_[2]);
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
ArrayList<String> slist = new ArrayList<>(0);
for (int i = 0; i < n; i++) {
String s = sc.next();
int pi = 100 - sc.nextInt();
String p = pi + "";
if (p.length() == 2) {
p = "0" + p;
}
if (p.length() == 1) {
p = "00" + p;
}
slist.add(s + p);
}
Object[] result = slist.toArray();
Arrays.sort(result);
for (int i = 0; i < n; i++) {
System.out.println(slist.indexOf(result[i]) + 1);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Res> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
String name = sc.next();
int point = Integer.parseInt(sc.next());
list.add(new Res(i, name, point));
}
Collections.sort(list, (r1, r2) -> {
if (!r1.name.equals(r2.name)) {
return r1.name.compareTo(r2.name);
}
else {
return r1.point < r2.point ? 1 : -1;
}
});
for (Res res : list) {
System.out.println(res.i + 1);
}
}
}
class Res {
int i;
String name;
int point;
Res (int i, String name, int point) {
this.i = i;
this.name = name;
this.point = point;
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[] sp = new String[n];
for (int i = 0; i < n; i++) {
String city = sc.next();
int point = sc.nextInt();
sp[i] = city + "_" + (1100 - point) + "_" + (i+1);
}
Arrays.sort(sp);
for (String s: sp) {
String ans = s.split("_")[2];
System.out.println(ans);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N=int(input())
ls=[list(input().split())+[i] for i in range(N)]
ls.sort(key=lambda x:(x[0],-int(x[1])))
for i in range(N):
print(ls[i][2]+1) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
l = []
for i in range(N):
s,p = input().split(" ")
l.append([s,-int(p),i+1])
l.sort()
for i in l:
print(i[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
Restaurant[] restaurants = new Restaurant[N];
for (int i = 0; i < N; i++) {
restaurants[i] = new Restaurant(i + 1, scanner.next(), scanner.nextInt());
}
Arrays.sort(restaurants, (r1, r2) -> {
if (!r1.s.equals(r2.s)) return r1.s.compareTo(r2.s);
return r2.p - r1.p;
});
for (int i = 0; i < N; i++) {
System.out.println(restaurants[i].id);
}
}
private static class Restaurant {
private final int id;
private final String s;
private final int p;
private Restaurant(int id, String s, int p) {
this.id = id;
this.s = s;
this.p = p;
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | [print(x[2])for x in sorted([(s[0],-int(s[1]),i+1)for i,s in enumerate([input().split()for _ in range(int(input()))])])] | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,p;
string s;
cin>>n;
vector<tuple<string,int,int>> t(n);
for(i=0;i<n;i++){
cin>>s>>p;
t.at(i)=make_tuple(s,-p,i+1);
}
sort(t.begin(),t.end());
for(auto z:t) cout<<get<2>(z)<<endl;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <iostream>
#include <map>
using namespace std;
int n;
pair<string,int> sp;
map<pair<string,int>,int> g;
int main(){
cin >> n;
for(int i=1;i<=n;i++){
cin >> sp.first >> sp.second;
sp.second*=-1;
g[sp]=i;
}
for(auto itr:g){
cout << itr.second << endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | // https://atcoder.jp/contests/abc128/tasks/abc128_b
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Collections;
import java.util.ArrayList;
import java.util.Arrays;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
TreeMap<String,TreeMap<Integer,Integer>> map = new TreeMap<>();
for (int i=1;i<N+1;i++){
String S = sc.next();
int P = sc.nextInt();
TreeMap<Integer,Integer> pi;
if (map.containsKey(S)){
pi = map.get(S);
} else {
pi = new TreeMap<>();
}
pi.put(P,i);
map.put(S,pi);
}
for (String s:map.keySet()){
Object[] key = map.get(s).keySet().toArray();
Arrays.sort(key,Collections.reverseOrder());
for (Object i:key){
System.out.println(map.get(s).get(i));
}
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N=int(input())
A=[]
for _ in range(N):
s,n=input().strip().split(" ")
n=int(n)
A+=[(s,-n,_+1)]
A=sorted(A)
for X in A:
print(X[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
NSI = [input().split() + [i + 1] for i in range(n)]
NSI.sort(key=lambda x:(x[0], -int(x[1])))
for _, _, i in NSI:
print(i) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
vector<pair<pair<string,int>,int> >v;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int x;
string s;
cin>>s>>x;
v.push_back(make_pair(make_pair(s,-x),i+1));
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
{
cout<<v[i].second<<endl;
}
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
string s;
int p;
pair<pair<string,int>,int>answer[n];
for(int i=0; i<n; i++){
cin >>s >>p;
answer[i]=make_pair(make_pair(s,-p),i+1);
}
sort(answer,answer+n);
for(int i=0; i<n; i++){
cout <<answer[i].second <<endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
a=[]
for i in range(n):
s,p=input().split()
a+=[(s,-int(p),i+1)]
a.sort()
for i in range(n):
print(a[i][2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n=int(input())
d=list(list(input().split())+[i+1] for i in range(n))
d.sort(key=lambda x:(x[0],-int(x[1])))
for v in d:print(v[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int number = sc.nextInt();
String[] info = new String[number];
for(int i = 0; i < number; i++) {
info[i] = sc.next() + "," + (Integer.MAX_VALUE - sc.nextInt()) + "," + (i+1);
}
Arrays.sort(info);
for(int j=0;j < number; j++){
String ans = info[j].split(",")[2];
System.out.println(ans);
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N = int(input())
SP = [input().split()+[i+1] for i in range(N)]
SP = sorted(SP, key=lambda x: (x[0], -int(x[1])))
for i in SP:
print(i[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner s = new Scanner(System.in)) {
final int N = s.nextInt();
List<Restaurant> list = new ArrayList<Main.Restaurant>(N);
for (int i = 0; i < N; i++) {
list.add(new Restaurant(i + 1, s.next(), s.nextInt()));
}
list.stream().sorted(
Comparator.comparing(Restaurant::getName).thenComparing(
Comparator.comparingInt(Restaurant::getPoint).reversed()))
.map(Restaurant::getNo)
.forEach(System.out::println);
}
}
static class Restaurant {
final int no;
final String name;
final int point;
public Restaurant(int no, String name, int point) {
this.no = no;
this.name = name;
this.point = point;
}
public int getNo() {
return no;
}
public String getName() {
return name;
}
public int getPoint() {
return point;
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
List<Guide> guids = new ArrayList<>();
for (int i = 0; i < n; i++) {
Guide g = new Guide();
g.place = sc.next();
g.score = sc.nextInt();
g.index = i + 1;
guids.add(g);
}
sc.close();
guids.sort((g1 , g2) -> {
int order = g1.place.compareTo(g2.place);
if (order != 0) {
return order;
} else {
return Integer.compare(g2.score, g1.score);
}
});
for (Guide guide : guids) {
// System.out.println(guide.place);
// System.out.println(guide.score);
System.out.println(guide.index);
// System.out.println();
}
// System.out.println(ans);
}
private static class Guide {
String place;
int score;
int index;
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
pair<pair<string,int>,int>p[1000];
for(int i=0;i<N;i++){
string S;
int T;
cin>>S>>T;
p[i]=make_pair(make_pair(S,-T),i+1);
}
sort(p,p+N);
for(int i=0;i<N;i++){
cout<<p[i].second<< endl;
}
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
sp = []
for i in range(n):
s,p = input().split()
sp.append([s, -int(p), i+1])
sp.sort()
for s,p,i in sp:
print(i) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string,int,int>> v;
for (int i=0;i<N;i++){
string S;
int P;
cin >> S >> P;
v.push_back(make_tuple(S,100-P,i+1));
}
sort(v.begin(),v.end());
for (int i=0;i<N;i++){
cout << get<2>(v[i]) << endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
map<string, int [110]> a;
for(int i = 0; i < n; ++i){
string s;
int p;
cin >> s >> p;
a[s][p]=i+1;
}
for (auto x : a){
for(int i =105; i >= 0; --i){
if(x.second[i]!=0){
cout << x.second[i] << endl;
}
}
}
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<tuple<string,int,int>>p;
for(int i=0;i<N;i++){
string s;
int a;
cin>>s>>a;
p.push_back(make_tuple(s, a*(-1), i+1));
}
sort(p.begin(), p.end());
for(int i=0;i<N;i++){
cout<<get<2>(p.at(i))<<endl;
}
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Comparator;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static void main(final String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
Map<String, Map<Integer, Integer>> city = new TreeMap<>();
for (int i = 1; i <= N; i++) {
String s = sc.next();
int p = sc.nextInt();
Map<Integer, Integer> point = null;
if (city.containsKey(s))
point = city.get(s);
else {
point = new TreeMap<>(new Comparator<Integer>() {
public int compare(Integer k1, Integer k2) {
return k2.compareTo(k1) ;
}
});
}
point.put(p, i);
city.put(s, point);
}
sc.close();
for(Map<Integer, Integer> point : city.values()) {
for(Integer index : point.values()) {
System.out.println(index);
}
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Comparator;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String[] town = new String[N];
Set<String> town2 = new TreeSet<>();
int[] point = new int[N];
for(int i=0;i<N;i++) {
town[i]=sc.next();
town2.add(town[i]);
point[i]=sc.nextInt();
}
for(String s: town2) {
Map<Integer,Integer> nums = new TreeMap<>(Comparator.reverseOrder());
for(int i=0;i<N;i++) {
if(s.equals(town[i])) {
nums.put(point[i],i+1);
}
}
for(Integer n : nums.keySet()) {
System.out.println(nums.get(n));
}
}
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i;
cin >> n;
vector<tuple<string,int,int>> a;
for(i=1;i<=n;++i){
string s;
int p;
cin >> s >> p;
p=-p;
a.push_back(tie(s,p,i));
}
sort(a.begin(),a.end());
for(i=0;i<n;++i){
cout << get<2>(a[i]) <<endl;
}
return 0;
}
| CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | n = int(input())
a = []
for i in range(n):
s, p = input().split()
a.append((s, -int(p), i))
a.sort()
for _, _, i in a:
print(i + 1) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | _, *sp = open(0).read().split()
for _, _, a in sorted([(s, -int(p), i + 1) for i, (s, p) in enumerate(zip(*[iter(sp)] * 2))]):
print(a) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
List<Restaurant> restaurants = new ArrayList<>();
for (int i = 0; i < n ; i++) {
Restaurant restaurant = new Restaurant(i+1, sc.next(),sc.nextInt());
restaurants.add(restaurant);
}
restaurants.sort(Comparator.comparing(Restaurant::getScore).reversed());
restaurants.sort(Comparator.comparing(Restaurant::getCity));
restaurants.forEach(r -> System.out.println(r.id));
}
static class Restaurant {
int id;
String city;
int score;
public Restaurant (int id, String city, int score) {
this.id = id;
this.city = city;
this.score = score;
}
public String getCity() {
return city;
}
public int getScore() {
return score;
}
}
}
| JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
@SuppressWarnings("resource")
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Pair[] pairs = new Pair[n];
for (int i = 0 ; i < n ; i++) {
Pair p = new Pair();
p.no = i + 1;
p.town = sc.next();
p.point = sc.nextInt();
pairs[i] = p;
}
Arrays.sort(pairs);
for (int i = 0 ; i < n ; i++) {
System.out.println(pairs[i].no);
}
}
}
class Pair implements Comparable {
int no;
String town;
int point;
@Override
public int compareTo(Object other) {
Pair otherpair = (Pair) other;
if (otherpair.town.equals(town)) {
return otherpair.point - point;
}
return town.compareTo(otherpair.town);
}
} | JAVA |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | # coding:utf-8
# BBBBBBBBBBB
import math
import re
def main(params):
n = int(params[0])
sp = params[1:]
cnt = 0
ipt = {}
for i in sp:
cnt += 1
s,p = i.split()
p = int(p)
if s in ipt:
ipt[s].append([p,cnt])
else:
ipt[s] = [[p,cnt]]
keys = ipt.keys()
keys.sort()
for k in keys:
if len(ipt[k]) == 1:
print ipt[k][0][1]
else:
ranks = ipt[k]
ranks.sort()
ranks.reverse()
for i in ranks:
print i[1]
if __name__ == "__main__":
n = int(raw_input())
cnt = n # TODO: edit here
params = [n]
for i in range(cnt):
param = raw_input()
params.append(param)
main(params)
| PYTHON |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,d,a;
string s;
cin>>n;
pair<pair <string,ll>,ll> p[n+1];
for(ll i=0;i<n;i++)
{
cin>>s>>a;
p[i]=make_pair(make_pair(s,-1*a),i+1);
}
sort(p,p+n);
for(ll i=0;i<n;i++)
{
cout<<p[i].second<<endl;
}
return 0;
} | CPP |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N=int(input())
a=[]
for i in range(N):
S,P=input().split()
P=int(P)
a.append([S, -P, i+1])
a.sort()
for i in a:
print(i[2]) | PYTHON3 |
p03030 AtCoder Beginner Contest 128 - Guidebook | You have decided to write a book introducing good restaurants. There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i. No two restaurants have the same score.
You want to introduce the restaurants in the following order:
* The restaurants are arranged in lexicographical order of the names of their cities.
* If there are multiple restaurants in the same city, they are arranged in descending order of score.
Print the identification numbers of the restaurants in the order they are introduced in the book.
Constraints
* 1 ≤ N ≤ 100
* S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.
* 0 ≤ P_i ≤ 100
* P_i is an integer.
* P_i ≠ P_j (1 ≤ i < j ≤ N)
Input
Input is given from Standard Input in the following format:
N
S_1 P_1
:
S_N P_N
Output
Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.
Examples
Input
6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40
Output
3
4
6
1
5
2
Input
10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100
Output
10
9
8
7
6
5
4
3
2
1 | 6 | 0 | N=int(input())
a=[]
for i in range(N):
S,P=input().split()
a.append((S,-1*int(P),i+1))
a.sort()
for j in a:
print(j[2]) | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.