-
Notifications
You must be signed in to change notification settings - Fork 0
/
1057.cpp
72 lines (66 loc) · 929 Bytes
/
1057.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
#define N 100005
int n;
int p;
int stack[N];
int flag[N];
void push(int data){
stack[p]=data;
p++;
flag[data]++;
}
int pop(void){
if(p<=0){
return -1;
}
p--;
flag[stack[p]]--;
return stack[p];
}
int PeekMedian(){
if(p<=0)
return -1;
int m;
m = p%2 ? (p+1)/2:p/2;
int j=0;
for(int i=0;i<N;i++)
if(flag[i]>0){
j++;
if(j==m)
return i;
}
return -1;
}
int main(){
scanf("%d",&n);
p=0;
memset(flag,0,sizeof(int)*N);
for(int i=0;i<n;i++){
char str[15];
scanf("%s",str);
int len=strlen(str);
if(len==3){
int ret;
ret=pop();
if(ret<0)
printf("Invalid\n");
else
printf("%d\n",ret);
}else if(len == 4){
int data;
scanf("%d",&data);
push(data);
}else{
int ret;
ret=PeekMedian();
if(ret<0)
printf("Invalid\n");
else
printf("%d\n",ret);
}
}
return 0;
}