Our Algorithm

#10040 투표
N, M = map(int, input().split(" ")) #N:경기수 M:심사위원수
A = []  #각 경기들의 비용을 재밌는 순서대로
B = []  #심사기준
C = []
for i in range(N):
    A.append(int(input()))
for j in range(M):
    B.append(int(input()))
for i in range(N):
    C.append(0)
for j in range(M):
    for i in range(N):
        if A[i] <= B[j]:
            C[i] += 1
            break
print(C.index(max(C)) + 1)

N = int(input())
xylist = []
for i in range(N):
    xylist.append(list(map(int,input().split())))
xylist.sort(key = lambda x:(x[0],x[1]))
print(xylist)

N = input()
sortlist = list(N)
sortlist.sort(reverse=True)
result = "".join(sortlist)
print(result)

def solution(test_case):
    number_alpha = ["one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
    number = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]
    for i in range(0, 9):
        result = test_case.replace(number_alpha[i], number[i])
        test_case = result
    return result
test_case=input()
print(solution(test_case))

def Solutions(testcase):
  count=0
  last_count=0
  for i in range(0,len(test_case)):
    if(test_case[i]==1):
      count+=1
    elif(test_case[i]==0):
      if(count>last_count):
        last_count=count
      count=0
  if(last_count>count):
    return last_count
  else:
    return count
test_case = list(map(int,input().split(' ')))
print(Solutions(test_case))