HDU4104--Discount-CSDN博客

Discount
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 954 Accepted Submission(s): 573

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.

Input
The input consists several testcases.
The first line contains one integer N (1 <= N <= 1000), the number of items available.
The second line contains N integers Pi (0 <= Pi <= 10000), represent the ith item’s price.

Output
Print one integer, the minimum budget that cannot be reached.

Sample Input
4
1 2 3 4

Sample Output
11

Source
2011 Alibaba-Cup Campus Contest

Recommend
lcy

 1 #include<cstdio>
 2 #include<cmath>
 3 #include<algorithm>
 4 #include<iostream>
 5 #include<cstring>
 6 using namespace std;
 7  
 8 int f[1001];
 9 bool cmp(int a,int b)
10 {
11     return a<b;
12 }
13  
14 int main()
15 {
16     int n;
17     while(scanf("%d",&n)!=EOF)
18     {
19         int i;
20         for(i=0;i<n;i++)
21         {
22             scanf("%d",&f[i]);
23         }
24         sort(f,f+n,cmp);
25         int sum=0;
26         for(i=0;i<n;i++)
27         {
28             if(sum+1<f[i])break;
29             sum+=f[i];
30         }
31         printf("%d\n",sum+1);
32     }
33     return 0;
34 }