← Back to List

6032번: Toy Shopping ↗

Solutions

Python 3
967 B | 967 chars
"""
[6032: Toy Shopping](https://www.acmicpc.net/problem/6032)

Tier: Silver 5 
Category: greedy, sorting
"""


import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
  sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
  n = ii()
  l = [[*mii(), _+1] for _ in range(n)]

  l.sort(key=lambda x: -(x[0] / x[1]))

  print(l[0][1] + l[1][1] + l[2][1])

  for i in range(3):
    print(l[i][2])

if __name__ == "__main__":
  tc = 1
  for t in range(1, tc+1):
    ret = solve()