gistfile1.txt

rcolife  …  codeRiddles  others  booking  cat hotels.py 
# Complete the function below.
import operator
from collections import defaultdict

def best_hotels():
    hotels = defaultdict(list)
    for i in range(int(input())):
        a,b = [int(i) for i in input().split()]
        hotels[a].append(b)
    hotels = {k:sum(v)/len(v) for (k,v) in hotels.items()}
    hotels = sorted(hotels.items(), key=operator.itemgetter(1), reverse=True)
    [print(i[0]) for i in hotels]

 arcolife  …  codeRiddles  others  booking  cat lexi.py 
# Complete the function below.
import itertools

def  find_all_possible_teams():
    arr = list(input())
    assert len(arr) < 26
    final = []
    for i in range(1, len(arr)+1):
        tmp = list(itertools.combinations(arr, i))
        final.extend([''.join(i) for i in tmp])
    [print(i) for i in final]
 arcolife  …  codeRiddles  others  booking  cat overlap.py
# Complete the function below.
import operator

def  merge_overlapping_intervals():
    arr = []
    stack = []
    for i in range(int(input())):
        arr.append([int(i) for i in input().split()])
    arr = sorted(arr, key=operator.itemgetter(0))
    stack.append(arr[0])
    # dump = []
    for cur in arr[1:]:
        if cur[0] <= stack[-1][1]:
            # dump.append(cur[0])
            stack[-1][1] = cur[1]
        else:
            stack.append(cur)
    # [print(i) for i in dump]
    print(len(stack))
    for cur in stack:
        print(' '.join([str(i) for i in cur]))
    #print(stack)