hdu 4104 Discount (思维 数学归纳法）

DiscountTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1072    Accepted Submission(s): 645

Problem Description
All the shops use discount to attract customers, but some shops doesn’t give direct discount on their goods, instead, they give discount only when you bought more than a certain amount of goods. Assume a shop offers a 20% off if your bill is more than 100 yuan, and with more than 500 yuan, you can get a 40% off. After you have chosen a good of 400 yuan, the best suggestion for you is to take something else to reach 500 yuan and get the 40% off.
For the customers’ convenience, the shops often offer some low-price and useful items just for reaching such a condition. But there are still many customers complain that they can’t reach exactly the budget they want. So, the manager wants to know, with the items they offer, what is the minimum budget that cannot be reached. In addition, although the items are very useful, no one wants to buy the same thing twice.
InputOutputSample InputSample OutputSourceRecommend#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <map>#include <stack>#include <vector>#include <set>#include <queue>//#pragma comment (linker,"/STACK:102400000,102400000")#define maxn 1005#define mod 1000000007#define INF 0x3f3f3f3fusing namespace std;typedef long long ll;int n,m,ans,cnt,flag,sum;int a[maxn];int dp[maxn];void solve(){ int i,j,u,v; sum=0; for(i=1;i<=n;i++) { if(a[i]>sum+1) { ans=sum+1; return ; } sum+=a[i]; } ans=sum+1;}int main(){ int i,j; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) { scanf("%d",&a[i]); } sort(a+1,a+n+1); solve(); printf("%d\n",ans); } return 0;}