UVa 10154 - Weights and Measures

最新推荐文章于 2018-12-05 22:42:41 发布

小坏蛋_千千

最新推荐文章于 2018-12-05 22:42:41 发布

阅读量438

点赞数 1

分类专栏： UVa OJ

------------------- 这是千千的个人网站哦！ https://www.dreamwings.cn -------------------

本文链接：https://blog.csdn.net/qq_28954601/article/details/50638825

版权

UVa OJ 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

UVa 10154 - Weights and Measures

I know, up on top you are seeing great sights,
But down at the bottom, we, too, should have rights.
We turtles can't stand it. Our shells will all crack!
Besides, we need food. We are starving!" groaned Mack.

The Problem

Mack, in an effort to avoid being cracked, has enlisted your advice as to the order in which turtles should be dispatched to form Yertle's throne. Each of the five thousand, six hundred and seven turtles ordered by Yertle has a different weight and strength. Your task is to build the largest stack of turtles possible.

Standard input consists of several lines, each containing a pair of integers separated by one or more space characters, specifying the weight and strength of a turtle. The weight of the turtle is in grams. The strength, also in grams, is the turtle's overall carrying capacity, including its own weight. That is, a turtle weighing 300g with a strength of 1000g could carry 700g of turtles on its back. There are at most 5,607 turtles.

Your output is a single integer indicating the maximum number of turtles that can be stacked without exceeding the strength of any one.

Sample Input

Sample Output

迷失在幽谷中的鸟儿，独自飞翔在这偌大的天地间，却不知自己该飞往何方……
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;
int f[6000];
struct ab
{
    int w,s;
} a[6000];
bool cmp(ab a,ab b)
{
    return a.s<b.s;
}
int main()
{
    int N=0;
    for(; ~scanf("%d%d",&a[N].w,&a[N].s); N++);
    sort(a,a+N,cmp);
    int M=0,i,j;
    memset(f,INF,sizeof(f));
    f[0]=0;
    for(i=0; i<N; i++)
        for(j=M; j>=0; j--)
        {
            if(a[i].s>=f[j]+a[i].w&&f[j]+a[i].w<f[j+1])
            {
                f[j+1]=f[j]+a[i].w;
                if(j+1>M) M=j+1;
            }
        }
    printf("%d\n",M);
    return 0;
}