Problem D. Recruitment

    单点时限:1000ms

    内存限制:256MB

    A company plans to recruit some new employees. There are N candidates (indexed
    from 1 to N) have taken the recruitment examination. After the examination,
    the well-estimated ability value as well as the expected salary per year of
    each candidate is collected by the Human Resource Department.

    Now the company need to choose their new employees according to these data. To
    maximize the company’s benefits, some principles should be followed:

    2. The sum of salaries per year of the chosen candidates should not exceed
    the given budget B.

    3. The sum of ability values of the chosen candidates should be maximum,
    without breaking the previous principles. Based on this, the sum of the salary
    per year should be minimum.

    4. If there are multiple answers, choose the lexicographically smallest one.
    In other words, you should minimize the smallest index of the chosen
    candidates; If there are still multiple answers, then minimize the second
    smallest index; If still multiple answers, then minimize the third smallest
    one; …

    Your task is to help the company choose the new employees from those
    candidates.

    Then follows N lines. The i-th line contains the data of the i-th candidate: a
    character G, and two integers V and S, separated by a single space. G
    indicates the gender (either “M” for male, or “F” for female), V is the well-
    estimated ability value and S is the expected salary per year of this
    candidate. 1 <= V <= 10000, 0 <= S <= 10.

    We assure that there is always at least one possible answer.

    On the first line, output the sum of ability values and the sum of salaries
    per year of the chosen candidates, separated by a single space.

    On the second line, output the indexes of the chosen candidates in ascending
    order, separated by a single space.

    样例输出

    2. 1 2