zoukankan      html  css  js  c++  java
  • Crixalis's Equipment 杭电 (设计贪心算法,比较巧妙,我用的是结构体排序)

    Problem Description
    Crixalis - Sand King used to be a  giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, he keeps the living habit of a scorpion like living underground and digging holes.
    Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.
     
    Input
    The first line contains an integer T, indicating the number of test cases. Then follows T cases, each one contains N + 1 lines. The first line contains 2 integers: V, volume of a hole and N, number of equipment respectively. The next N lines contain N pairs of integers: Ai and Bi. 0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.
     
    Output
    For each case output "Yes" if Crixalis can move all his equipment into the new hole or else output "No".
     
    Sample Input
    2
    
    20 3
    10 20
    3 10
    1 7
    
    10 2
    1 10
    2 11
     
    Sample Output
    Yes
    No
     
     
    Source
    HDU 2009-10 Programming Contest
     
    Recommend
    #include <stdio.h>
    struct std{
        int ai;
        int bi;
        int cha;
    };
    struct std a[1000];
    
    void sort(std *a,int number);
    
    void main()
    {
        int n,v,num;
        scanf("%d",&n);
        while(n--)
        {
            scanf("%d%d",&v,&num);
            for(int i=0;i<num;i++)
            {
                scanf("%d%d",&a[i].ai,&a[i].bi);
                a[i].cha=a[i].bi-a[i].ai;
            }
            sort(a,num);
            for(i=0;i<num&&(v>=a[i].bi);i++)
                    v=v-a[i].ai;
            if(i==num)
                printf("Yes
    ");
            else
                printf("No
    ");
    
        }
        
    }
    
    void sort(std *a,int number)
    {
        std temp;
        for(int i=0;i<number-1;i++)
            for(int j=0;j<number-i-1;j++)
            {
                if(a[j].cha<a[j+1].cha)
                {
                     temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                }
                if(a[j].cha==a[j+1].cha)
                {
                    if(a[j].bi<a[j+1].bi)
                    { temp=a[j];
                        a[j]=a[j+1];
                        a[j+1]=temp;
                    }
                }
    
            }
    }
  • 相关阅读:
    [原创]快速排序(C++版)
    连接mysql8.0时报错的问题
    关于idea无法使用搜狗输入法打出汉字的解决方案(转)
    bootStrap select组件相关问题
    idea 项目可以运行但是jsp中url报红的问题
    idea 项目启动找不到页面问题和run/debug只能启动一个的问题
    form序列化到后台中文乱码
    在js中获取bootStrap table 的属性
    三元运算符,多条件时判断
    Spring获取日期时间差8小时问题解决
  • 原文地址:https://www.cnblogs.com/shaomg/p/3570141.html
Copyright © 2011-2022 走看看