-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathG.cpp
58 lines (54 loc) · 1.28 KB
/
G.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
// #define pb push_back
// #define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a,n) a, a + n
using namespace std;
bool sortbysec(const vector<int> &a,
const vector<int> &b) {
if (a[1] < b[1]) {
return true;
} else if (a[1] > b[1]) {
return false;
} else {
if (a[0] > b[0]) {
return true;
} else if (a[0] < b[0]) {
return false;
} else {
return a[2] > b[2];
}
}
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin) ;
freopen("output.txt", "w", stdout) ;
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL) ; cout.tie(NULL) ;
int n;
cin >> n;
std::vector<vector<int>> v;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
vector<int> tempV;
tempV.push_back(x);
tempV.push_back(y);
tempV.push_back(i + 1);
v.push_back(tempV);
}
sort(v.begin(), v.end(), sortbysec);
for (int i = 0; i < n; i++) {
cout << v[i][2] << " ";
}
cout << "\n";
return 0 ;
}