1921. Eliminate Maximum Number of Monsters

문제 링크 : https://leetcode.com/problems/eliminate-maximum-number-of-monsters/description/

class Solution:
    def eliminateMaximum(self, dist: List[int], speed: List[int]) -> int:
        res =0
        minreach = []
        for d, s in zip(dist,speed):
            minu = math.ceil(d/s)
            minreach.append(minu)
        
        minreach.sort()
        for i in range(len(minreach)):
            if i >= minreach[i]:
                return res
            res +=1
        return res

dist/speed로 나누어 몬스터들이 도시에 오는 시간을 기준으로 정렬한다