zoukankan      html  css  js  c++  java
  • [POJ] 1456 Supermarket

    Supermarket
    Time Limit: 2000MS      Memory Limit: 65536K
    Total Submissions: 14630        Accepted: 6648
    Description
    
    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.
    Source
    
    Southeastern Europe 2003

    贪心思想,优先卖出最贵的商品,尽量往后安排,使其具有决策包容性。
    并查集维护一个时间最早的可用时间。

    #include<iostream>
    #include<algorithm>
    using namespace std;
    
    const int MAXN=10010;
    
    struct item{
        int val,tim;
        bool operator<(item y) const {
            return val > y.val ;
        } 
    }it[MAXN];
    
    int fa[MAXN];
    int fnd(int x){
        return x==fa[x]?x:fa[x]=fnd(fa[x]);
    }
    void cat(int x,int y){
        x=fnd(x);
        y=fnd(y);
        fa[y]=x;
    }
    
    int n;
    
    void slove(){
        int ans=0;
        for(int i=1;i<=n;i++)
            cin>>it[i].val>>it[i].tim ;
        for(int i=1;i<=10005;i++) fa[i]=i;
        sort(it+1,it+1+n);
        for(int i=1;i<=n;i++){
            int v=it[i].tim;
            int nv=fnd(v);
            if(nv<=0) continue;
            cat(nv-1,nv);
            ans+=it[i].val;
        }
        cout<<ans<<endl;
    }
    
    int main(){
        while(cin>>n) slove();
    }

    本文来自博客园,作者:GhostCai,转载请注明原文链接:https://www.cnblogs.com/ghostcai/p/9247471.html

  • 相关阅读:
    软件测试学习总结
    MySQL数据库中主键和索引的区别和联系
    什么是接口测试及其测试流程
    bug生命周期
    啊这...2-get/post请求区别,来给你看看post请求url中传参
    啊这...1-get/post请求区别,你还在认为get只能在url传参吗?传json格式会咋样?
    关于博客园全站内容审核中...如出现此问题:请移步xxx
    git-2-企业级gitlab的使用及管理工具Sourcetree
    fiddler-12-Proxifier+fiddler进行PC端抓包
    微信小程序弹出订阅消息确认弹窗的限制
  • 原文地址:https://www.cnblogs.com/ghostcai/p/9247471.html
Copyright © 2011-2022 走看看