HDOJ1678 Shopaholic
来源:互联网 发布:整形医院网络推广方案 编辑:程序博客网 时间:2024/05/16 10:46
Shopaholic
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3329 Accepted Submission(s): 1823
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
题意:三件商品中最便宜的一件免费,现在要求能得到的最大的优惠是多少。
可以排下序,每第三个就加起来(不一定有第三个)
import java.util.Arrays;import java.util.Scanner;public class Main{private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);int cases = scanner.nextInt();while(cases-->0){int n = scanner.nextInt();int arr[] = new int[n];for (int i = 0; i < arr.length; i++) {arr[i] = scanner.nextInt();}Arrays.sort(arr);int sum = 0;int p = arr.length-1-2;while(p>=0){sum += arr[p];p -= 3;}System.out.println(sum);}}}
阅读全文
0 0
- hdoj1678 Shopaholic
- HDOJ1678 Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- Shopaholic
- 1438. Shopaholic
- zoj2883----------------------Shopaholic
- HDU1678:Shopaholic
- POJ3637 Shopaholic
- hdu1678 Shopaholic
- Shopaholic 1678
- HDU:Shopaholic
- P - Shopaholic
- 贪心&Shopaholic
- 2017年数据可视化的七大趋势!
- 大数问题(模板)
- 简单的场景组织
- 火了!清华博士发现微信抢最大红包秘笈!为此他发了2亿个红包
- GAN能合成2k高清图了!还能手动改细节 | 论文+代码,英伟达出品
- HDOJ1678 Shopaholic
- 实现右键菜单集成FTP功能
- Struts2中ONGL的常用标准标签浅析
- android 自定义控件TextInputSelectBox用法
- 【codeforces388A】贪心
- <a>href中有中文,导致后台获取乱码问题
- DirectX11笔记(十)--Direct3D渲染6--PIXEL SHADER
- href链接传参乱码问题解决
- 【每日一题(20)】数圈圈 2017年哈尔滨理工大学新生赛低年级组