hdu 1678
来源:互联网 发布:黑道圣徒4人物数据 编辑:程序博客网 时间:2024/06/07 22:40
Shopaholic
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 997 Accepted Submission(s): 547
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
//题目要求在买3付2的打折活动下,获取最大折扣//将数据排序,从最大值开始3个一组,获取最小值,累加和就是所求值#include <iostream>#include <algorithm>using namespace std;int main(){int t, n, mdis, a[20001], i;scanf("%d", &t);while (t--){scanf("%d", &n);for(i = 0; i < n; i++)scanf("%d", &a[i]);sort(a, a+n);mdis = 0;for(i = n-3; i >= 0; i -= 3)mdis += a[i];printf("%d\n", mdis);}return 0;}
- HDU 1678
- hdu 1678
- HDU 1678 Shopaholic
- Shopaholic hdu 1678
- hdu 1678 Shopaholic
- hdu-oj 1678 Shopaholic
- HDU 1678 Shopaholic(贪心)
- HDOJ(HDU) 1678 Shopaholic
- hdu 1678 Shopaholic
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- ”与目标计算机类型“ARM”冲突
- 开放式WEP和共享式WEP的区别
- 产品解决问题的通用思路
- C++多重继承和虚拟继承对象模型、效率分析
- Yii ajax验证表单、分页、Yii ajax分页
- hdu 1678
- ubuntu下中英显示配置
- 使用Eclipse Juno进行C/C++开发
- 视频会议将是未来即时通讯平台的主流
- 模块及模块间的接口方式
- 【小蒙淘金】11.4金评-非农强势即将来袭,一级战斗准备
- createBitmap时out of memory!!!!!!!
- HTTP与socket的介绍与区别分析
- 使用gdal对图像建立金字塔