Problem:
Score : 300 points

Problem Statement

When l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.

You are given N numbers X_1, X_2, ..., X_N, where N is an even number.
For each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.

Find B_i for each i = 1, 2, ..., N.

Constraints

2 \leq N \leq 200000

N is even.

1 \leq X_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
X_1 X_2 ... X_N

Output

Print N lines.
The i-th line should contain B_i.

Sample Input 1

4
2 4 4 3

Sample Output 1

4
3
3
4

Since the median of X_2, X_3, X_4 is 4, B_1 = 4.

Since the median of X_1, X_3, X_4 is 3, B_2 = 3.

Since the median of X_1, X_2, X_4 is 3, B_3 = 3.

Since the median of X_1, X_2, X_3 is 4, B_4 = 4.

Sample Input 2

2
1 2

Sample Output 2

2
1

Sample Input 3

6
5 5 4 4 3 3

Sample Output 3

4
4
4
4
4
4

Solution in C (GCC 5.4.1) (judge verdict: Accepted)



#pragma warning(disable:4996)
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX_STRING 100

	char sInput[MAX_STRING+1]="";
	int anX[200000];
	int anY[200000];
	int compar(const int *val1, const int *val2);

int main() {
//	char* psInput;

	int i=0;
	int j=0;
	int nMin=0;
	int nMax=0;
	int nNow=0;
	int nCount=0;
	int nNumber=0;
	int nMiddleIndex=0;
	int nTempMiddle=0;
	int nFirstMiddle=0;
	int nSecondMiddle=0;

	// read line 1
    scanf("%d", &nNumber);
	// read line 2
	for(i=0; i<nNumber; i++) {
        scanf("%d", &anX[i]);
		anY[i]=anX[i];
	}
	// sort
    qsort(anY, nNumber, sizeof(int),
        (int (*)(const void *, const void *))compar
    );
	nMiddleIndex=(nNumber/2)-1;
	nFirstMiddle=anY[nMiddleIndex];
	nSecondMiddle=anY[nMiddleIndex+1];

	if (nNumber==2){
		printf("%d\n%d\n",anX[1],anX[0]);
	} else {
		for (i=0; i<nNumber; i++){
			if(anX[i]<nFirstMiddle){
				printf("%d\n",nFirstMiddle);
			} else {
				printf("%d\n",nSecondMiddle);
			}
		}
	}

    return 0;
}
int compar(const int *val1, const int *val2) {
    if ( *val1 > *val2 ) {
        return -1;
    } else if ( *val1 == * val2 ) {
        return 0;
    } else {
        return 1;
    }
}