Finding Team Member

B. Finding Team Member

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the values of the strengths aredistinct.

Every contestant hopes that he can find a teammate so that their team’s strength is as high as possible. That is, a contestant will form a team with highest strength possible by choosing a teammate from ones who are willing to be a teammate with him/her. More formally, two people A and B may form a team if each of them is the best possible teammate (among the contestants that remain unpaired) for the other one.

Can you determine who will be each person’s teammate?

Input

There are 2n lines in the input.

The first line contains an integer n (1 ≤ n ≤ 400) — the number of teams to be formed.

The i-th line (i > 1) contains i - 1 numbers ai1, ai2, ... , ai(i - 1). Here aij (1 ≤ aij ≤ 106, all aij are distinct) denotes the strength of a team consisting of person i and person j (people are numbered starting from 1.)

Output

Output a line containing 2n numbers. The i-th number should represent the number of teammate of i-th person.

Sample test(s)

input

2
6
1 2
3 4 5

output

2 1 4 3

input

3
487060
3831 161856
845957 794650 976977
83847 50566 691206 498447
698377 156232 59015 382455 626960

output

6 5 4 3 2 1

Note

In the first sample, contestant 1 and 2 will be teammates and so do contestant 3 and 4, so the teammate of contestant 1, 2, 3, 4 will be2, 1, 4, 3 respectively.

  思路：

    这题应该是完全图中找边之和最大的两个点连起来。想不到的是要用贪心来做。因为每个都是从1 - n的，所以每次选最大的，但是如果遇到相同的

价值时就必须找边连接的两个端点值最大的，由下至上找最优。

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
using namespace std;
typedef __int64 ll;
#define CRL(a) memset(a,0,sizeof(a))
#define T 5050
struct node
{
	int L,R;
	int val;
}Node;
bool operator<(const node& a,const node& b)
	{
		return a.val<b.val||(a.val==b.val&&a.L<b.L)||(a.val==b.val&&a.L==b.L&&a.R<b.R);
	}
int bo[T];
int main()
{
   /* freopen("input.txt","r",stdin);*/
	int n,i,j,k;
	while(~scanf("%d",&n))
	{
		n*=2;CRL(bo);
		priority_queue<node> a;
		for(i=2;i<=n;++i)
			for(j=1;j<i;++j){
				scanf("%d",&Node.val);
				Node.L = i;Node.R=j;
				a.push(Node);
			}k=0;
			while(!a.empty())
			{
				Node = a.top(),a.pop();
				if(!bo[Node.L]&&!bo[Node.R]){
					bo[Node.L]=Node.R;
					bo[Node.R]=Node.L;
				}
			}
			for(i=1;i<=n;++i)
				printf("%d ",bo[i]);
			printf("\n");
	}
    return 0;
}