class Solution: def solve(self , n , k , a ): # write code here def Midnumber(liebiao): length=len(liebiao) l=sorted(liebiao) i=int(length/2) return l[i] changdu=n xulie=a aa=[] for i in range(0,changdu-k+1): for j in range(i+k,changdu+1): liebiao=xulie[i:j] aa.append(Midnumber(liebiao)) return max(aa)