Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define LL unsigned long long
- using namespace std;
- int n;
- int main() {
- vector<int> v;
- while(scanf("%d",&n)!=EOF){
- v.push_back(n);
- sort(v.begin(),v.end());
- if(v.size()==1){
- printf("%d\n",n);
- }else if(v.size()==2){
- printf("%d\n",(v[0]+v[1])/2);
- }else{
- int md=v.size()/2;
- if((v.size())%2==0){
- int calc=((v[md-1]+v[md])/2);
- printf("%d\n",calc);
- }else{
- printf("%d\n",v[md]);
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement