MathForces: Math Olympiads
MathForces - Math Olympiadsβeta
Login Register

Fancy meal

Author: anonymous
Problem has been solved: 66 times

Русский язык | English Language

Odmen came to a dining hall to have a fancy meal. There are $n = 563$ plates with food in this dining hall, and in each of them there is a burger and some fries (the total weight of food on each plate is equal to 1). Odmen wants to eat either the whole burger or all fries from each plate, so that the total mass of the left burgers is not greater than $x$, and the total mass of the left fries is not greater than $x$. Find the minimal possible value of $x$ which Odmen can guarantee himself independently of the initial shares of burgers and fries on the plates.

Sorry, you need to login into your account