周三总结

贪心算法已经讲了很久了，对贪心算法掌握的也越来越熟练了，不过在提交时容易超时很苦恼。在这里也没有太多对贪心的几节了，不过有一道题感觉还不错，虽然很简单。题目如下 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. InputA 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.OutputFor 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 Input4 50 2 10 1 20 2 30 17 20 1 2 1 10 3 100 2 8 2 5 20 50 10Sample Output80185HintThe 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 <iostream>#include <algorithm>using namespace std;const int n=10010;struct pro{ int p,d;} s[n];bool cmp(pro a,pro b){ return a.d<=b.d;}int main(){ int n; while(cin>>n) { for(int i=0;i<n;i++) cin>>s[i].p>>s[i].d; sort(s,s+n,cmp); int money=0; for(int j=0;j<n-1;j++) { if(s[j].d=s[j+1].d) { if(s[j].p>=s[j+1].p) { s[j+1].p=s[j].p; s[j].p=0; } else s[j].p=0; } } for(int j=0;j<n;j++) money+=s[j].p; cout<<money<<endl;}} 看到这道题我首先想到的是按利润进行排序，不过仔细思考后截止日期同样所有商品只能卖一个，所以可以按日期进行排序，找出同一天利润最高的卖出就好了，思想其实的确很简单。