BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)

原创 2015年11月18日 10:23:01

Clarke and food

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


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 ith 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(1T10), the number of the test cases.
For each test case: 
The first line contains two integers n,V(1n105,1V109)
The second line contains n integers, the ith integer denotes vi(1vi109).
 

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.
 



题目链接:点击打开链接

脑洞题, 本以为是背包, 读入数据后排序, 从小到大一直拿, 拿到不能拿为止可以使装食物数量最大.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "utility"
#include "map"
#include "set"
#include "vector"
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
int n, v, a[MAXN];
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        scanf("%d%d", &n, &v);
        for(int i = 0; i < n; ++i)
            scanf("%d", &a[i]);
        sort(a, a + n);
        int sum = 0, ans = 0;
        for(int i = 0; i < n; ++i) {
            sum += a[i];
            if(sum <= v) ans++;
            else break;
        }
        printf("%d\n", ans);
    }
    return 0;
}

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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

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

BestCoder Round #62 (div.2)-Clarke and food(模拟)

Clarke and food    Accepts: 353    Submissions: 962  Time Limit: 2000/1000 MS (Java/Others)    Memo...

BestCoder Round #62 (div.2)-Clarke and baton(二分搜索)

Clarke and baton    Accepts: 1    Submissions: 126  Time Limit: 12000/6000 MS (Java/Others)    Memo...

BestCoder Round #62 (div.2)-Clarke and five-pointed star(几何)

Clarke and five-pointed star    Accepts: 237    Submissions: 591  Time Limit: 2000/1000 MS (Java/Ot...

BestCoder Round #62 (div.2) HDU 5563 Clarke and five-pointed star

Clarke and five-pointed star                                           Time Limit: 2000/1000 MS (Ja...

HDU 5563 Clarke and five-pointed star(判断正五边形)——BestCoder Round #62(div.1 div.2)

HDU 5563 Clarke and five-pointed star(判断正五边形)——BestCoder Round #62(div.1 div.2)

【HDU5565 BestCoder Round 62 (div1)C】【STL or 二分答案 or 计数排序】Clarke and baton n个人减肥m次求最后异或值

【HDU5565 BestCoder Round 62 (div1)C】【优先队列做法】Clarke and baton n个人减肥m次求最后异或值 #include #include #i...

【HDU5563 BestCoder Round 62 (div1)A】【计算几何 凸包】Clarke and five-pointed star 正五边形判定 正五角星判定

#include #include #include #include #include #include #include #include #include #include #include ...

hdu5463 Clarke and minecraft(BestCoder Round #56 (div.2) )

Clarke and minecraft Accepts: 414 Submissions: 738 Time Limit: 2000/1000 MS (Java/Others) Memory...
  • d_x_d
  • d_x_d
  • 2015年09月19日 20:31
  • 1004

BestCoder Round #72 (div.2) B.Clarke and points

& hdoj 5626 题意: 平面上n个点,求两点间最大的曼哈顿距离。 题解: 假设A, B两点使得曼哈顿距离最大,去绝对值,可以化简如下: 则只要分别求出最大和最小的、即可。 #incl...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)
举报原因:
原因补充:

(最多只允许输入30个字)