Shopaholic hdu 1678
来源:互联网 发布:知名网络模特 编辑:程序博客网 时间:2024/06/10 08:15
Shopaholic
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1509 Accepted Submission(s): 846
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.
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
16400 100 200 350 300 250
Sample Output
400
Source
2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3)
Recommend
lcy | We have carefully selected several similar problems for you: 1673 1677 1674 1676 1672
这个题目是说三个里面选出一个最小的不用付账,所以从排一下序,把第三个,第五个。。。。。等等加起来就好了
#include<stdio.h>#include<stdlib.h>#include<iostream>#include<algorithm>using namespace std;int price[20005];int comp(const void *a, const void *b){ return *(int *)b - *(int *)a;}int main(){ int sum, n, i, T; scanf("%d", &T); while(T--) { scanf("%d", &n); for(i = 0; i < n; i++) { scanf("%d", &price[i]); } qsort(price, n, sizeof(price[0]), comp); sum=0; for(i = 2;i < n; i+= 3) { sum += price[i]; } printf("%d\n", sum); } return 0;}
0 0
- HDU 1678 Shopaholic
- Shopaholic hdu 1678
- hdu 1678 Shopaholic
- hdu-oj 1678 Shopaholic
- HDU 1678 Shopaholic(贪心)
- HDOJ(HDU) 1678 Shopaholic
- hdu 1678 Shopaholic
- HDU 1678 Shopaholic(排序)
- HDU:Shopaholic
- HDU 1678 Shopaholic(简单数学题 贪心)
- Shopaholic 1678
- HDU 1687 Shopaholic【数学题】
- hdu 1678(Shopaholic )(最大折扣)(水题,cheapest)
- HDU 1678 Shopaholic(优先队列 + 排序 + 英文-我想哭)
- hdoj.1678 Shopaholic 20141018
- HDOJ 1678 Shopaholic
- Shopaholic
- Shopaholic
- java 命名规范和系统常见包
- [MySQL Help]MySQL Workbench用csv格式导出数据乱码
- [iOS]使用Audio Queue Services 播放和录制音频
- boost时间操作
- Centos 6.5 x86_64环境下编译hadoop 2.2.0 mvn版本兼容性问题处理
- Shopaholic hdu 1678
- 第三次作业
- JAVA多线程的问题以及处理【转】
- /*面向对象语言*/与原型模式【35】
- C++命名规则
- 简单的一些shell脚本学习--Unix命令行程序
- 束表决函数作用
- 2014-03-13周四:内存释放函数HeapFree ()内存开辟函数HeapAlloc重新开辟函数HeapReAlloc
- iphone simulator 如何添加图片到相册