BestCoder Round #62 (div.2) HDU 5562 Clarke and food

Clarke and food

                                                              Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                            Total Submission(s): 216    Accepted Submission(s): 123

Problem Description

Clarke is a patient with multiple personality disorder. One day, Clarke turned into a cook, was shopping for food. 
Clarke has bought  n  food. The volume of the  i th food is  vi . Now Clarke has a pack with volume  V . He wants to carry food as much as possible. Tell him the maxmium number he can brought with this pack.

 

Input

The first line contains an integer  T(1≤T≤10) , the number of the test cases.
For each test case: 
The first line contains two integers  n,V(1≤n≤105,1≤V≤109) . 
The second line contains  n  integers, the  i th integer denotes  vi(1≤vi≤109) .

 

Output

For each test case, print a line with an integer which denotes the answer.

 

Sample Input

  
  

   
   1
3 5
1 3 4
  
  

 

Sample Output

  
  

   
   2

Hint:  
We can carry 1 and 3, the total volume of them is 5.  
  
  

 

Source

BestCoder Round #62 (div.2)

出题人：

可以证明从小到大一直拿，拿到不能拿为止是最优的。

所以排序一下即可。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
const int N=100005;
int a[N];
int main()
{
    int n,t,sum;
    int i,j;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&sum);
        for(i=0; i
      
      
       
       =a[i])
            {
                sum-=a[i];
                temp++;
            }
            else break;
        }
        printf("%d\n",temp);
    }
    return 0;
}