Submission #2866466

Source Code Expand

N = gets.to_i
Xs = gets.split.map(&:to_i)

xs = Xs.sort
m = xs[(N + 1)/2 - 1]
Xs.each{|x| puts x <=  m ? xs[(N + 1)/2] : m}

Submission Info

Submission Time
Task C - Many Medians
User noriakiokubo
Language Ruby (2.3.3)
Score 300
Code Size 128 Byte
Status AC
Exec Time 301 ms
Memory 23396 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 7 ms 1788 KB
10.txt AC 284 ms 22852 KB
11.txt AC 271 ms 22776 KB
12.txt AC 201 ms 15456 KB
2.txt AC 147 ms 12680 KB
3.txt AC 291 ms 23068 KB
4.txt AC 283 ms 22856 KB
5.txt AC 296 ms 23292 KB
6.txt AC 285 ms 22848 KB
7.txt AC 220 ms 15840 KB
8.txt AC 284 ms 22848 KB
9.txt AC 301 ms 23396 KB
sample1.txt AC 7 ms 1788 KB
sample2.txt AC 7 ms 1788 KB
sample3.txt AC 7 ms 1788 KB