import heapq
d = [5, -2, 3, 4, 1, 7 -3, 11, -9, 0, -1, 6]
a = heapq.nsmallest(1, d)
b = heapq.nlargest(1, d)
print(*a, *b)

import heapq
s = [2, 1, 3]
heapq.heapify(s)
print(s[0])

avg = lambda x: sum(x) / len(x)
def f(values):
    a, *b, c = values
    return avg(b)
f([0, 2, 3, 4])

recs = [(1, 2, 3), (1, 2), (3, 4), (0, 1, 2, 3, 4)]
s = 0
for a, *b in recs:
    s += sum(b)
print(s)

import sys
def f(n):
  if n == 0:
    return 1
  return n * f(n-1)  # 1
sys.setrecursionlimit(1000)  # 2 
f(50)  # 3 
sys.setrecursionlimit(1)  # 4
f(50)  # 5

from heapq import heappush, heappop
def f(iterable):
    h = []
    for value in iterable:
        heappush(h, value)
    return [heappop(h) for i in range(len(h))]
print(f([3, 5, 1]))

from heapq import heappush, heappop
h = []
heappush(h, (5, 'a'))
heappush(h, (7, 'b'))
heappush(h, (3, 'c'))
print(heappop(h)[1])

class User:
    def __init__(self, name):
        self.name = name
a = (1, User('foo'))
b = (2, User('bar'))
c = (2, User('new'))
print(a < b, b < c)

a = (1, 'foo')
b = (2, 'bar')
c = (2, 'z')
print(a < b, b < c)

from collections import defaultdict
d = defaultdict(list)
d['a'].append(1)
d['a'].append(2)
d['b'].append(3)
sum((len(d['a']*3), len(d['b'])*5))