-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10107 What is the Median.cpp
52 lines (52 loc) · 1.36 KB
/
10107 What is the Median.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <limits>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define seto(a,n,x) for(int zyzzy = 0; zyzzy < n; zyzzy++) a[zyzzy] = x
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
/*freopen("1in.txt", "r", stdin);
freopen("1out.txt", "w", stdout);*/
vector<ll> nums;
ll temp,i = 0,t1,t2;
while(sll(temp)!=EOF)
{
nums.push_back(temp);
i++;
if(i%2)//odd
{
nth_element(nums.begin(),nums.begin()+(nums.size()/2),nums.end());
printf("%lld\n",nums[nums.size()/2]);
}
else
{
nth_element(nums.begin(),nums.begin()+(nums.size()/2),nums.end());
t1 = nums[nums.size()/2];
nth_element(nums.begin(),nums.begin()+(nums.size()/2)-1,nums.end());
t2 = nums[nums.size()/2-1];
printf("%lld\n",(t1+t2)/2);
}
}
return 0;
}