Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #6262 https://kpolyakov.spb.ru/school/ege/gen.php?action=viewAllEgeNo&egeId=26&cat160=on
- data = open('26.txt').readlines()
- n = int(data[0])
- s = 100000
- a = list(map(int, data[1:]))
- a.sort()
- answ = (0, 0)
- for sk in range(n):
- skid = []
- for i in range(-sk, 0):
- skid.append(a[i] / 2)
- a_i = 0
- sk_i = 0
- sm = 0
- k = 0
- while sm <= s:
- if (k + 1) % 6 == 0:
- if sk_i < sk:
- sm += skid[sk_i]
- sk_i += 1
- k += 1
- else:
- break
- else:
- if a_i < n - sk:
- sm += a[a_i]
- a_i += 1
- k += 1
- else:
- break
- if sm > s:
- if k % 6 == 0:
- sm -= skid[sk_i - 1]
- k -= 1
- else:
- sm -= a[a_i - 1]
- k -= 1
- answ = max(answ, (k, s - sm))
- print(answ)
Advertisement
Add Comment
Please, Sign In to add comment