The Slowest Runner, and Their Lane

Someone has to hand the tired-turtle trophy to the slowest runner. 🐢

You get a list of race times (at least one) — higher time = slower. Lanes are numbered from 1. Print the slowest time and its lane number, separated by a space. First of any ties wins.

Example:

Input: times = [61, 74, 59, 74] Output: 74 2

The slowest time is 74, first seen at position 1 (lane 2). Strict > keeps that first lane instead of the later tie at lane 4.