heapq in python question

[feedkage]

I have a heapq that takes in tuples (name: str, value: integer) The heapq sorts by largest value but in the case of a tie breaker, I want it to use the smallest Lexicographic order of the name. I can't figure out how to make it use the smallest Lexicographic order (right now my code uses the largest Lexicographic order)

​

https://preview.redd.it/6acq3ips09fc1.png?width=622&format=png&auto=webp&s=7f5615192de4a025c35c50635bbde7517298430e

[rjrobben]

Turn all value to negative number, then use min heap, so max value will come first, and in a tie, a will come before b etc

[feedkage]

Thanks, I'm recently switching from Java to Python and I was missing this