FilesExpand file tree

 master

/

1306.cpp

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

67 lines (55 loc) · 1.08 KB

 master

/

1306.cpp

Top

File metadata and controls

• Code
• Blame

67 lines (55 loc) · 1.08 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

53

54

55

56

57

58

59

60

61

62

63

64

65

66

#include <iostream>

#include <string>

#include <vector>

#include <algorithm>

#include <stdio.h>

#include <iomanip>

#include <queue>

#include <list>

#include <stack>

#include <map>

#include <set>

using namespace std;

#define DEBUG

#define REP(i,a) for(i=0;i<a;i++)

#define FOR(i,a,b) for(i=a;i<b;i++)

#define VE vector<int>

#define SZ size()

#define PB push_back

const int MAXN=250005;

//unsigned int data[MAXN];

priority_queue<unsigned int> Q;

int N;

void work(){

int cnt = 0;

int half = N/2 + 1;

for(int i=0; i<N; i++){

unsigned int t;

scanf("%u", &t);

Q.push(t);

//Q.push(data[i]);

if(Q.size() > half){

Q.pop();

}

}

double ans = 0.0;

if(N%2==0){

unsigned int A=Q.top();Q.pop(); unsigned int B = Q.top();

ans = A*1.0;

ans += B;

ans/=2.0;

}else{

ans = Q.top()*1.0;

}

cout<<setprecision(1)<<fixed<<ans<<endl;

}

int main(){

scanf("%d", &N);

/*

for(int i=0; i<N; i++){

scanf("%u", &data[i]);

}

*/

work();

return 0;

}