HDU1678 Shopaholic【水题】
来源:互联网 发布:unity3d手游大全 编辑:程序博客网 时间:2024/06/16 11:34
Shopaholic
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1754 Accepted Submission(s): 975
Problem Description
Lindsay is a shopaholic. Whenever there is a discount of the kind where you can buy three items and only pay for two, she goes completely mad and feels a need to buy all items in the store. You have given up on curing her for this disease, but try to limit its effect on her wallet.
You have realized that the stores coming with these offers are quite elective when it comes to which items you get for free; it is always the cheapest ones. As an example, when your friend comes to the counter with seven items, costing 400, 350, 300, 250, 200, 150, and 100 dollars, she will have to pay 1500 dollars. In this case she got a discount of 250 dollars. You realize that if she goes to the counter three times, she might get a bigger discount. E.g. if she goes with the items that costs 400, 300 and 250, she will get a discount of 250 the first round. The next round she brings the item that costs 150 giving no extra discount, but the third round she takes the last items that costs 350, 200 and 100 giving a discount of an additional 100 dollars, adding up to a total discount of 350.
Your job is to find the maximum discount Lindsay can get.
Input
The first line of input gives the number of test scenarios, 1 <= t <= 20. Each scenario consists of two lines of input. The first gives the number of items Lindsay is buying, 1 <= n <= 20000. The next line gives the prices of these items, 1 <= pi <= 20000.
Output
For each scenario, output one line giving the maximum discount Lindsay can get by selectively choosing which items she brings to the counter at the same time.
Sample Input
1
6
400 100 200 350 300 250
Sample Output
400
思路:没事水一水
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int a[20000];bool cmp(int a,int b){ return a > b;}int main(){ int T; cin >> T; while(T--) { int N; cin >> N; for(int i = 0; i < N; ++i) { cin >> a[i]; } sort(a,a+N,cmp); int ans = 0; for(int i = 0; i < N; ++i) { if(i % 3 == 2) { ans += a[i]; } } cout << ans << endl; } return 0;}
0 0
- HDU1678 Shopaholic【水题】
- HDU1678:Shopaholic
- hdu1678 Shopaholic
- HDU1678 Shopaholic
- zoj 2883 Shopaholic水题
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- hdu1678(用sort 排序)
- hdu 1678(Shopaholic )(最大折扣)(水题,cheapest)
- 1438. Shopaholic
- zoj2883----------------------Shopaholic
- POJ3637 Shopaholic
- Shopaholic 1678
- 光电整纬机(日本世联电子株式会社)
- 将WordPress作者存档链接中的用户名改为用户ID
- 05.编辑模式-删除
- 周总结
- cocos2dx3.1 texturepacker播放动画
- HDU1678 Shopaholic【水题】
- 颠倒数组中的所有元素
- WordPress 修改自定义文章类型的固定链接结构
- 杂谈
- jquery validate使用和扩展规则,jqueryvalidate
- 吝啬的国度 nyoj
- HDU1708 Fibonacci String【水题】
- C# 调用C++ DLL 总结
- Linux 下安装Eclipse