import heapq
grades = [110, 25, 38, 49, 20, 95, 33, 87, 80, 90]
print(heapq.nlargest(3, grades))
print(heapq.nsmallest(4, grades))
[110, 95, 90]
[20, 25, 33, 38]
#Exercise 3 - Find the largest and smallest number in a list
thislist = input("How many numbers do you want to enter:")
newlist = []
for x in range (0, int(thislist)):
owl = int(input("Please Enter your numbers:"))
newlist.append(owl)
print ("The max number entered is:", max(newlist))
print ("The min number entered is:", min(newlist))
thislist = [677,8765,8765,876,470,754,6784,56789,7658,]
thislist.sort()
print ("The smallest number is: " + str(thislist[0]))
print ("The largest number is: " + str(thislist[-1]))
# find the n smallest and greatest numbers in list
import heapq
numbers = [10, 40, 25, 500, 90, 59, 320, 200, 100, 800]
print(heapq.nlargest(4, numbers))
# [800, 500, 320, 200]
import heapq
numbers = [10, 40, 25, 500, 90, 59, 320, 200, 100, 800]
print(heapq.nsmallest(4, numbers))
# [10, 25, 40, 59]