Submission #2831879


Source Code Expand

#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;

int main(){
	int N;
	cin >> N;
	vector<int> X(N);
	for(int i = 0; i < N; ++i) cin >> X[i];
	vector<int> Y = X;
	sort(ALL(Y));
	for(int i = 0; i < N; ++i) {
		if(X[i] <= Y[N / 2 - 1]) {
			cout << Y[N / 2] << endl;
		} else {
			cout << Y[N / 2 - 1] << endl;
		}
	}
	return 0;
}

Submission Info

Submission Time
Task C - Many Medians
User blue_jam
Language C++14 (GCC 5.4.1)
Score 300
Code Size 441 Byte
Status AC
Exec Time 395 ms
Memory 3712 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 1 ms 256 KB
10.txt AC 370 ms 3584 KB
11.txt AC 382 ms 3328 KB
12.txt AC 284 ms 2816 KB
2.txt AC 194 ms 1920 KB
3.txt AC 383 ms 3584 KB
4.txt AC 373 ms 3584 KB
5.txt AC 391 ms 3712 KB
6.txt AC 378 ms 3584 KB
7.txt AC 300 ms 2816 KB
8.txt AC 370 ms 3584 KB
9.txt AC 395 ms 3712 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB