-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCode.py
102 lines (86 loc) · 2.07 KB
/
Code.py
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
def remove_item(arr,n,i,j):
if i>=j:
return False, arr
m = (i+j)//2
if arr[m]==n:
arr.pop(m)
return True , arr
elif j-i == 1 :
return False, arr
else:
if arr[m]> n :
return remove_item(arr,n,i,m)
else:
return remove_item(arr,n,m,j)
def insert_n(arr,n,i,j):
m = (i+j)//2
if arr[m]>n and arr[m-1]<n:
return arr[:m] + [n]+ arr[m:]
elif arr[m] == n :
return arr[:m] + [n]+ arr[m:]
else:
if arr[m]> n :
return insert_n(arr,n,i,m)
else:
return insert_n(arr,n,m,j)
def insert_f(arr,n):
l = len(arr)
if l == 0 :
arr.append(n)
elif l == 1:
if arr[0] > n:
arr.insert(0,n)
else:
arr.append(n)
elif n < arr[0]:
arr.insert(0,n)
return arr
elif n> arr[-1]:
arr.append(n)
return arr
else:
arr = insert_n(arr,n,0,l)
return arr
def cal_medina(arr):
l = len(arr)
if l == 0 :
print("Wrong!")
else:
# arr = sorted(arr)
if l%2==0:
c = int(l/2)
ave = (arr[c]+arr[c-1])/2
if ave% 1 == 0 :
print(int(ave))
else:
print(ave)
else:
print(arr[int(l/2)])
def median(a,x):
arr = []
# opers = zip(a,x)
for i in range(len(x)):
if a[i] == "r":
if len(arr)==0:
print("Wrong!")
else:
f, arr = remove_item(arr,x[i],0,len(arr))
if f :
cal_medina(arr)
else:
print("Wrong!")
# else:
# print("Wrong!")
elif a[i] == 'a':
arr = insert_f(arr,x[i])
# print(arr)
cal_medina(arr)
N = int(input())
s = []
x = []
for i in range(0, N):
tmp = input().strip().split(' ')
a, b = [xx for xx in tmp]
s.append(a)
x.append(int(b))
median(s,x)