ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

<PREV Problem:

Solved by 473 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
white_dragon	`09 jan 2010`	Perl	63	01.57	21
white_dragon	`09 jan 2010`	Perl	23	01.48	26
white_dragon	`09 jan 2010`	Perl	15	01.20	32
white_dragon	`09 jan 2010`	Perl	14	01.19	38
xtender	`08 jan 2010`	Perl	20	01.20	48
kil	`11 jul 2007`	Ruby	25	03.01	50
vi002	`11 jul 2007`	Ruby	22	02.98	51
var	`11 jul 2007`	Ruby	14	03.08	51
var	`11 jul 2007`	Ruby	13	02.94	53
kil	`11 jul 2007`	Ruby	16	03.01	54
sb3ar	`11 may 2008`	Ruby	17	03.21	55
sb3ar	`12 feb 2008`	Ruby	15	03.21	56
kil	`11 jul 2007`	Ruby	24	03.00	57
sb3ar	`11 may 2008`	Ruby	16	03.03	58
s97302	`29 jan 2010`	Ruby	8	02.66	60
s97302	`29 jan 2010`	Ruby	4	02.57	61
s97302	`29 jan 2010`	Ruby	3	02.49	62
qdiesel	`07 nov 2008`	Ruby	3	03.06	63
stasg7	`10 dec 2009`	Ruby	13	02.07	68
Yajiv	`05 oct 2007`	Python	5	04.63	68
xtender	`08 jan 2010`	Perl	18	00.85	69

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Athletes

Time limit = 3 second(s)

Every athlete is characterized by his mass m_i (in kg) and strength s_i(in kg).

You are to find the maximum number of athletes that can form a tower standing one upon another.

An athlete can hold a tower of athlets with total mass equal to his strength or less than his strength.

Input contains the number of athletes n and their parameters:

n
m₁ s₁
m₂ s₂
...
m_n  s_n

If m_i > m_j then s_i > s_j, but athletes with equal masses can be of different strength.

Number of athletes n < 100000. Masses and strengths are positive integers less than 2000000.

Input#1

Output#1

Author: