即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

(贪心)Supermarket

编程语言 TchChan 10℃ 0评论
A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes
precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit
of the selling schedule is Profit(Sell)=Σ x∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.



For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts
at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.








Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.


Input
A set of products starts with an integer 0 <= n <= 10000, which is the number of products in the set, and continues with n pairs pi di of integers, 1 <= pi <= 10000 and 1 <= di <= 10000, that designate the profit and the selling deadline of the i-th product. White spaces can occur freely in input. Input data terminate with an end of file and are guaranteed correct.
Output
For each set of products, the program prints on the standard output the profit of an optimal selling schedule for the set. Each result is printed from the beginning of a separate line.
Sample Input
4  50 2  10 1   20 2   30 1

7  20 1   2 1   10 3  100 2   8 2
   5 20  50 10
Sample Output
80
185
Hint
The sample input contains two product sets. The first set encodes the products from table 1. The second set is for 7 products. The profit of an optimal schedule for these products is 185.


这道题有点无语,看不懂英文,上博客看的题意,然后题意理解错了,然后理解题意后用的贪心,

然后代码如下,只能说是水题,该换难度了

#include
#include
#include
#include
using namespace std;
int n,p1,d1;
struct Node{
    int p;
    int d;
}node[10010];
int vis[10010];
bool cmp(const Node &p1,const Node &q1)
{
    return (p1.p>q1.p);
}
int main()
{
    while(cin>>n)
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i>node[i].p>>node[i].d;
        }
        sort(node,node+n,cmp);
        int sum=0;
        for(int i=0;i=1;--j)
                {
                    if(!vis[j])
                    {
                        sum+=node[i].p;
                        vis[j]=1;
                        break;
                    }
                }

            }

        printf("%d\n",sum);
    }
}





转载请注明:CodingBlog » (贪心)Supermarket

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情