155B - Combination - CodeForces Solution

greedy sortings *1100

Please click on ads to support us..

Python Code: 

n = int(input())
l = []
for i in range(n):
	l.append(list(map(int, input().split())))
l.sort(key=lambda x: (-x[1], -x[0]))
c = 1
ind = 0
ans = 0
while c > 0 and ind < n:
	ans += l[ind][0]
	c += l[ind][1]
	ind += 1
	c -= 1
print(ans)


Comments

Submit
0 Comments
More Questions

1672C - Unequal Array
1706C - Qpwoeirut And The City
1697A - Parkway Walk
1505B - DMCA
478B - Random Teams
1705C - Mark and His Unfinished Essay
1401C - Mere Array
1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort
538B - Quasi Binary
424A - Squats
1703A - YES or YES
494A - Treasure
48B - Land Lot
835A - Key races
1622C - Set or Decrease
1682A - Palindromic Indices
903C - Boxes Packing
887A - Div 64
755B - PolandBall and Game
808B - Average Sleep Time
1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy