hdoj.1678 Shopaholic 20141018
来源:互联网 发布:淘宝极速退款条件 编辑:程序博客网 时间:2024/05/21 04:19
Shopaholic
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1696 Accepted Submission(s): 956
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<stdio.h>#include<stdlib.h>/*每三件商品中最便宜的便是折扣*/int cmp(const void *a,const void *b){ return *(int *)b-*(int *)a;}int main(){ int t,n,i,p[20010],sum; scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&p[i]); qsort(p,n,sizeof(p[0]),cmp); sum=0; for(i=0;i<n;i++){ if(i%3==2) sum+=p[i]; } printf("%d\n",sum); } return 0;}
0 0
- hdoj.1678 Shopaholic 20141018
- HDOJ(HDU) 1678 Shopaholic
- HDOJ 1678 Shopaholic
- Shopaholic 1678
- HDU 1678 Shopaholic
- Shopaholic hdu 1678
- hdu 1678 Shopaholic
- hdu-oj 1678 Shopaholic
- HDU 1678 Shopaholic(贪心)
- hdu 1678 Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- HDU 1678 Shopaholic(排序)
- 内部类
- css+div学习笔记
- Tight words (dp)
- 线程并发工具--Exchanger
- 抉择
- hdoj.1678 Shopaholic 20141018
- (7)Launcher3客制化之,修改单屏幕后,Fix在Hotseat拖动应用删除报错
- 收藏的android大神的博客地址
- NYIST 542 - 试制品 (STL + 小暴力)
- 加油加油
- [数据结构] 二叉树的操作实现
- 使scp不用输入密码
- Ubuntu14.04 下使用tasksel架建LAMP
- Storm的tuple介绍