HDU6335 Problem D. Nothing is Impossible

原题：http://acm.hdu.edu.cn/showproblem.php?pid=6335

Problem Description

m students, including Kazari, will take an exam tomorrow.
The paper consists of exactly n problems, the i-th problem contains ai correct answers and bi incorrect answers, i.e. the i-th problem contains ai+bi candidates in total.
Each student should choose exactly one candidate as answer for each problem. If the answer to a certain problem is correct, then the student will get one point. The student who gets the most points wins.
Students only know the structure of the paper, but they are able to talk with each other during the exam. They decide to choose a subset S of all n problems, and they will only be able to submit answers on these problems.
They want to know the maximum size of S that the winner among them will solve all the problems in S if they take the optimal strategy.

For sample 1, students can choose S={1}，and we need at least 4 students to guarantee the winner solve the only problem.

For sample 2, students can choose S={1,2,3}, and we need at least 24 students to guarantee the winner solve these three problems, but if |S|=4, we need at least 96 students, which is more than 50.

 

Input

The first line of the input contains an integer T (1≤T≤100) denoting the number of test cases.
Each test case starts with two integers n,m (1≤n≤100,1≤m≤109), denoting the number of problems and the number of students. Each of next n lines contains two integers ai,bi （1≤bi≤100,ai=1）, indicating the number of correct answers and the number of incorrect answers of the i-th problem.

 

Output

For each test case, print an integer denoting the maximum size of S.

 

Sample Input

2

3 5

1 3

1 3

1 3

5 50

1 1

1 3

1 2

1 3

1 5

 

Sample Output

1

3

 

分析：这道题比赛的时候表示体验感极差，中途修改了两次题目，反正表示一开始没有弄懂（不知道大佬咋做的QAQ），修改了题目以后就是一道很容易的题目了，先对b进行排序，然后只要每次使当前全对的人数*（1/（bi+1））即可，当没法除的时候就结束。

#include<bits/stdc++.h>
using namespace std;
int t, n, m;
int ans;
int b[200];

void dfs(int res, int pos, int sum){
    ans = max(ans, sum);
    if(pos > n) return;
    if(res >= b[pos]+1){
        int temp = res / (b[pos]+1);
        int temp1 = res - temp;
        dfs(temp, pos+1, sum+1);
    }
    else return;
}


int main(){
    scanf("%d", &t);
    while(t--){
        scanf("%d%d", &n, &m);
        int temp;
        for(int i=1; i<=n; i++){
            scanf("%d%d", &temp, &b[i]);
        }
        sort(b+1, b+1+n);
        ans = 0;
        dfs(m, 1, 0);
        cout<<ans<<endl;
    }
}