Greedy algorithm 1013

Main topic:

Give two number, profit and loss, the company in the annual statistics 8 times, each time the statistics 5 months, so there are overlapping parts, 8 times the result of statistics are deficit, seek profit

Problem Solving Ideas:

Since there is a deficit each time, so there is at least one D in 5 months, there are four cases, the number of months of profit *s-loss of the number of months *d for the request

Code:

#include <iostream>#include<algorithm>using namespacestd;intMain () {ints,d,sum;  while(cin>>s>>d) {if(4*s<d) Sum=Ten*s-2*D; Else if(3*s<2*d) Sum=8*s-4*D; Else if(2*s<3*d) Sum=6* (S-d); Else if(s<4*d) Sum=3*s-9*D; if(sum>0) cout<<sum<<Endl; Elsecout<<"deficit"<<Endl; }    return 0;}

Greedy algorithm 1013