Submission #2384341


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector<int> v;

int main() {
  cin >> n;
  v = vector<int>(n, 0);
  for (int &i: v) cin >> i;
  vector<int> w(v);
  sort(w.begin(), w.end());
  int l = w[n/2 - 1], r = w[n/2];
  if (l == r) {
    for (int i = 0; i < n; ++i) cout << l << endl;
  } else {
    for (int i = 0; i < n; ++i) {
      v[i] <= l ? cout << r << endl : cout << l << endl;
    }
  }
}

Submission Info

Submission Time
Task C - Many Medians
User mican_
Language C++14 (GCC 5.4.1)
Score 300
Code Size 470 Byte
Status AC
Exec Time 396 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 379 ms 3584 KB
11.txt AC 375 ms 3328 KB
12.txt AC 278 ms 2688 KB
2.txt AC 196 ms 1920 KB
3.txt AC 390 ms 3584 KB
4.txt AC 369 ms 3584 KB
5.txt AC 394 ms 3712 KB
6.txt AC 376 ms 3584 KB
7.txt AC 295 ms 2816 KB
8.txt AC 374 ms 3584 KB
9.txt AC 396 ms 3712 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB