heapq terbesar
heapq.nlargest(3, li1)
manumanoj
heapq.nlargest(3, li1)nlargest in heapq
nlargest(k, iterable, key = fun) :-
This function is used to return the k largest elements from the iterable
specified and satisfying the key if mentioned.
code:
'''
# Python code to demonstrate working of
# nlargest() and nsmallest()
# importing "heapq" to implement heap queue
import heapq
# initializing list
li1 = [6, 7, 9, 4, 3, 5, 8, 10, 1]
# using heapify() to convert list into heap
heapq.heapify(li1)
# using nlargest to print 3 largest numbers
# prints 10, 9 and 8
print("The 3 largest numbers in list are : ",end="")
print(heapq.nlargest(3, li1))
# using nsmallest to print 3 smallest numbers
# prints 1, 3 and 4
print("The 3 smallest numbers in list are : ",end="")
print(heapq.nsmallest(3, li1))
'''
output :
'''
The 3 largest numbers in list are : [10, 9, 8]
The 3 smallest numbers in list are : [1, 3, 4]
'''