HDUOJ-4104 Discount

Discount

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 984    Accepted Submission(s): 591

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

       这道题，开始以为是母函数，后来觉得数据处理貌似不行。又改为背包，内存直接爆掉了！！，我勒个去，没得办法，之后去了一趟度娘那，

  才发现是一道.....貌似不能归于哪一类，就是杂谈吧！

       方法是这样的...先进行排序（由小到大）也就是升序....然后用他后面n-1一项的和加1来与当前这项比较，如果当前这项小于前者之和加1,那么就是这个数

      ，是不能被组合出来的...

       就拿 1 2 3 4 这组数据来讲吧.... 开始 sum=0; sum+1<1 ，不满足，所以跳到下一个数，此时sum=1; sum+1<2.。又不满足，所以继续...依次-----最后..还是不满足。

      所以就输出 sum+1( 注意此时的sum=1+2+3+4=10)，所以 输出的是10.

      再比如 1 3 4 5  begin sum=0; sum+1<1 不满足，继续...sum+=1；sum+1<3；满足，所以终止，输出；

     依据这一原理：

     代码如下：

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 #define maxn 1001
 5 using namespace std;
 6 int value[maxn];
 7 int main()
 8 {
 9     int n,i,sum;
10     while(~scanf("%d",&n))
11     {
12         for(i=0;i<n;i++)
13             scanf("%d",value+i);
14         sort(value,value+n);
15         sum=0;
16         for(i=0;i<n;i++)
17        {
18             if(sum+1<value[i])
19                 break;
20             sum+=value[i];
21        }
22         cout<<sum+1<<endl; 
23     }
24  return 0;
25 }