Shopaholic
来源:互联网 发布:安卓订餐系统源码 编辑:程序博客网 时间:2024/05/19 02:25
H - Shopaholic
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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;int a[20005];int main(){ int t; cin>>t; while(t--) { int n; cin>>n; int sum=0; for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); int m=n/3; for(int j=1;j<=m;j++) { sum+=a[n-j*3]; } cout<<sum<<endl; } return 0;}
0 0
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- 1438. Shopaholic
- zoj2883----------------------Shopaholic
- HDU1678:Shopaholic
- POJ3637 Shopaholic
- hdu1678 Shopaholic
- Shopaholic 1678
- HDU:Shopaholic
- P - Shopaholic
- 贪心&Shopaholic
- hdoj1678 Shopaholic
- HDU1678 Shopaholic
- 初学Java,List和ListIterator
- Optimal Parking
- IntelliJ IDEA如何在Gradle项目中支持Web Application
- 1856-More is better-基础并查集
- 【LeetCode】- 面试频率和难度分析
- Shopaholic
- hdu 3067 小t的游戏 (找规律)
- Common FileUpload组件的使用
- War
- hdu1686
- html2
- 在Windows7下玩老游戏花屏的解决办法
- An easy problem
- [LeetCode] Balanced Binary Tree