The document describes finding the largest subset of winners from a set of competitors where each competitor has values for r and s. A competitor can be a winner if there exist values R and S such that the ratio R/r + S/s is minimum. It notes that a competitor cannot win if another has both lower r and s values. The analysis shows that the winners are the subset of competitors forming the lower-left convex hull when plotted as (1/r, 1/s) points. Implementation requires care with precision issues when dealing with fractions and handling duplicated competitors for the convex hull algorithm.