Loading problem

Car Fleet

Cars head to a destination at `target` on a one-lane road. Car i starts at `position[i]` with constant `speed[i]` and cannot pass; a faster car catching a slower one forms a fleet moving at the slower speed. Return the number of fleets that arrive at the destination.

Examples

in: target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]

out: 3

three groups reach the target

Constraints

0 <= len(position) <= 10^5
0 < speed[i] <= 10^6
positions are distinct, all < target

Hints

target: O(n log n) time⌘↩ run · ⇧⌘↩ submit