杭电1678(Shopaholic)
来源:互联网 发布:北京时间网络触屏版 编辑:程序博客网 时间:2024/06/07 01:32
点击打开杭电1678
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
#include<iostream>#include<algorithm>using namespace std;bool cmp (int a,int b){ return a>b;}int main(){ int t,n,a[20005],i,sum; cin>>t; while(t--) { cin>>n; for (i=0;i<n;i++) cin>>a[i]; sort(a,a+n,cmp); sum=0; for(i=1;i*3<=n;i++) sum+=a[i*3-1]; cout<<sum<<endl; }}
0 0
- 杭电1678(Shopaholic)
- 杭电 1678 Shopaholic(606比赛选拔 2017-08-20) (1001)
- 杭电OJ题 1678 Shopaholic 解题报告
- HDU 1678 Shopaholic(排序)
- Shopaholic 1678
- HDU 1678 Shopaholic(简单数学题 贪心)
- HDU 1678 Shopaholic
- Shopaholic hdu 1678
- hdu 1678 Shopaholic
- hdu-oj 1678 Shopaholic
- hdoj.1678 Shopaholic 20141018
- HDU 1678 Shopaholic(贪心)
- HDOJ(HDU) 1678 Shopaholic
- hdu 1678 Shopaholic
- HDOJ 1678 Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- mnesia用户手册的阅读总结:
- Android 你应该知道的学习资源 进阶之路贵在坚持
- web前端性能优化
- 使用 FusionCharts 1.0 中 setDataURL() 函数的问题
- 黑马程序员-----java 集合框架(学习日记)
- 杭电1678(Shopaholic)
- 安装ssh远程连接 linux
- spark sql cache table
- arcgis api for flex 中文教程
- Intent中所有属性试玩(intentfilter,data,category,flag)
- Java.File
- uva10870 Recurrences矩阵快速幂
- C++项目目录组织结构
- gpg修改