Submission #6214796


Source Code Expand

Copy
#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
  int N, K = 0; cin >>N;
  vector<int> ds(N);
  for(int& d : ds){ cin >>d; }
  sort(ds.begin(), ds.end());
  for(int k = ds[0]; k <= ds[N - 1]; k++){
    int i = lower_bound(ds.begin(), ds.end(), k) - ds.begin();
    if(N / 2 == i) K++;
  }
  cout <<K <<endl;
  return 0;
}

Submission Info

Submission Time
Task C - Divide the Problems
User unigiri
Language C++14 (GCC 5.4.1)
Score 300
Code Size 414 Byte
Status
Exec Time 40 ms
Memory 640 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 2 ms 256 KB
07.txt 2 ms 256 KB
08.txt 1 ms 256 KB
09.txt 1 ms 256 KB
10.txt 3 ms 256 KB
11.txt 3 ms 256 KB
12.txt 3 ms 256 KB
13.txt 20 ms 640 KB
14.txt 8 ms 384 KB
15.txt 20 ms 384 KB
16.txt 21 ms 512 KB
17.txt 18 ms 384 KB
18.txt 20 ms 384 KB
19.txt 23 ms 640 KB
20.txt 23 ms 640 KB
21.txt 40 ms 640 KB
22.txt 39 ms 640 KB
23.txt 39 ms 640 KB
24.txt 40 ms 640 KB
25.txt 39 ms 640 KB
26.txt 38 ms 640 KB
27.txt 38 ms 640 KB
28.txt 37 ms 640 KB
29.txt 29 ms 640 KB
30.txt 28 ms 640 KB
31.txt 28 ms 640 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 2 ms 256 KB