zoukankan      html  css  js  c++  java
  • P

    P - Shopaholic
    Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

    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 selective 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

    1
    6
    400 100 200 350 300 250

    Sample Output

    400

    my answer:

    #include<iostream>
    #include<algorithm>
    #include<cmath>
    using namespace std;
    bool cmp(int a,int b)
    {
    	return a>b;
    }
    int main()
    {
    	int T,n;
    	cin>>T;
    	while(T--)
    	{
    		cin>>n;
    		int a[20002];
    		for(int i=0;i!=n;i++){
    			cin>>a[i];
    		}
    		sort(a,a+n,cmp);
    		if(n>=3){
    			int i=2,sum=0;
    			for(;i<n;i+=3){
    				sum+=a[i];
    			}
    			cout<<sum<<endl;
    		}
    		else
    		cout<<0<<endl;	 
    	}
    	return 0;
    }


  • 相关阅读:
    PHP数组
    java中线程池的几种实现方式
    JAVA是是如何处理字符的。
    byte范围及8种常见数据类型
    对Spring 及SpringMVC的理解
    Nginx+Tomcat搭建负载均衡
    nginx + tomcat配置负载均衡
    Java并发编程:Lock
    Java内部类详解
    奇怪的Java题:为什么1000 == 1000返回为False,而100 == 100会返回为True?
  • 原文地址:https://www.cnblogs.com/NYNU-ACM/p/4248807.html
Copyright © 2011-2022 走看看