Repair crew order

Choose the order in which a repair crew should visit damaged sites so the total loss is smallest.

After a storm, one crew must repair n sites, one after another, starting at hour 0. Site i takes hours hours to repair and, until its repair is finished, costs loss per hour in lost business. Every hour counts from hour 0, so a site whose repair finishes at hour F costs F * loss in total. The crew never idles and never leaves a site half-repaired.

Among all orders that give the smallest total loss, choose the lexicographically smallest one: compare the site numbers in visiting order, and the order with the smaller number at the first difference wins.

Input: jobs, a list of [hours, loss] pairs; site i is jobs[i].

Output: the list of site numbers in the order they are visited, for the order with the smallest total loss (and, among those, the lexicographically smallest). If there are no sites, return an empty list.

With up to 1,000 sites the number of possible orders is astronomical, so trying them is not an option. Comparing two sites by dividing their numbers can be misleading when the numbers are large: compare exactly.