import heapq


class Solution:

    def eliminateMaximum(self, dist: List[int], speed: List[int]) ->int:
        timeToReachList = []
        heapq.heapify(timeToReachList)
        distLen = len(dist)
        for i in range(distLen):
            timeToReach = dist[i] / speed[i]
            heapq.heappush(timeToReachList, timeToReach)
        outcome = 0
        count = 0
        while True:
            count += 1
            if count > distLen:
                break
            curTime = heapq.heappop(timeToReachList)
            if outcome < curTime:
                outcome += 1
            else:
                break
        return outcome

f5983c9dc08f8b6976fde003edecb627e1c2f49f
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def eliminateMaximum(self, dist: List[int], speed: List[int]) ->int:
        timeToReachList = []
        heapq.heapify(timeToReachList)
        distLen = len(dist)
        for i in range(distLen):
            timeToReach = dist[i] / speed[i]
            heapq.heappush(timeToReachList, timeToReach)
        outcome = 0
        count = 0
        while True:
            count += 1
            if count > distLen:
                break
            curTime = heapq.heappop(timeToReachList)
            if outcome < curTime:
                outcome += 1
            else:
                break
        return outcome

import heapq


class Solution:

    def eliminateMaximum(self, dist: List[int], speed: List[int]) ->int:
        timeToReachList = []
        heapq.heapify(timeToReachList)
        distLen = len(dist)
        for i in range(distLen):
            timeToReach = dist[i] / speed[i]
            heapq.heappush(timeToReachList, timeToReach)
        outcome = 0
        count = 0
        while True:
            count += 1
            if count > distLen:
                break
            curTime = heapq.heappop(timeToReachList)
            if outcome < curTime:
                outcome += 1
            else:
                break
        return outcome
