title: key function for heapq.nlargest()
body: <p>I have a dictionary with <code>{key: count}</code>, say
  <code>status_count = {'MANAGEMENT ANALYSTS': 13859, 'COMPUTER PROGRAMMERS': 72112}</code>
  and I am trying to write a key function for heapq.nlargest() that sorts based on count and if there are ties I have to sort based on alphabetical order(a-z) of keys. I have to use heapq.nlargest because of very large N and small k = 10. </p>
  
  <p>This is what I got until now, </p>
  
  <p><code>top_k_results = heapq.nlargest(args.top_k, status_count.items(), key=lambda item: (item[1], item[0]))
  </code>
  But, this would be incorrect in case of breaking ties with alphabetical order. Please help!</p>