forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
53 lines (44 loc) · 1.36 KB
/
B.cpp
File metadata and controls
53 lines (44 loc) · 1.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
struct Pair {
int x, y;
int s;
} a[1000111];
bool operator < (const Pair& a, const Pair& b) {
return a.s > b.s;
}
bool used[1011];
int mat[1011];
int main() {
ios :: sync_with_stdio(false);
int n;
while (cin >> n) {
n *= 2;
int k = 0;
FOR(i,1,n) FOR(j,1,i-1) {
++k;
a[k].x = i;
a[k].y = j;
cin >> a[k].s;
}
sort(a+1, a+k+1);
memset(used, 0, sizeof used);
FOR(i,1,k) {
if (!used[a[i].x] && !used[a[i].y]) {
mat[a[i].x] = a[i].y;
mat[a[i].y] = a[i].x;
used[a[i].x] = used[a[i].y] = true;
}
}
FOR(i,1,n) cout << mat[i] << ' '; cout << endl;
}
}