HDU - 6438 优先队列，+贪心。

The Power Cube is used as a stash of Exotic Power. There are nn cities numbered 1,2,…,n1,2,…,n where allowed to trade it. The trading price of the Power Cube in the ii-th city is aiai dollars per cube. Noswal is a foxy businessman and wants to quietly make a fortune by buying and reselling Power Cubes. To avoid being discovered by the police, Noswal will go to the ii-th city and choose exactly one of the following three options on the ii-th day: 

1. spend aiai dollars to buy a Power Cube 
2. resell a Power Cube and get aiai dollars if he has at least one Power Cube 
3. do nothing 

Obviously, Noswal can own more than one Power Cubes at the same time. After going to the nn cities, he will go back home and stay away from the cops. He wants to know the maximum profit he can earn. In the meanwhile, to lower the risks, he wants to minimize the times of trading (include buy and sell) to get the maximum profit. Noswal is a foxy and successful businessman so you can assume that he has infinity money at the beginning. 

Input

There are multiple test cases. The first line of input contains a positive integer TT (T≤250T≤250), indicating the number of test cases. For each test case: 
The first line has an integer nn. (1≤n≤1051≤n≤105) 
The second line has nn integers a1,a2,…,ana1,a2,…,an where aiai means the trading price (buy or sell) of the Power Cube in the ii-th city. (1≤ai≤1091≤ai≤109) 
It is guaranteed that the sum of all nn is no more than 5×1055×105. 

Output

For each case, print one line with two integers —— the maximum profit and the minimum times of trading to get the maximum profit.

Sample Input

3
4
1 2 10 9
5
9 5 9 10 5
2
2 1

Sample Output

16 4
5 2
0 0


        
  

Hint

In the first case, he will buy in 1, 2 and resell in 3, 4. 
         
  profit = - 1 - 2 + 10 + 9 = 16
In the second case, he will buy in 2 and resell in 4. 
         
  profit = - 5 + 10 = 5
In the third case, he will do nothing and earn nothing. 
         
  profit = 0

        
 

 

尽力买小的，然后卖。。

从第一个开始，把要买的放进优先队列（小根堆）里。

后面的如果小于等于堆顶 就放入堆顶。

大于的话   就把堆顶的卖了，然后买入2次a[i]，打个标记代表这个操作过。

后面再进行买卖是不计入交易次数。

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
priority_queue<ll,vector<ll>,greater<ll> >que;
const int M =100000+100;
long long a[M];
map<ll,ll>vis;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
    	while(!que.empty()) que.pop();
        vis.clear();
        ll n;
        scanf("%lld",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%lld",&a[i]);
        }
        int cnt=0;
        long long sum=0;
        que.push(a[1]);
        for(int i=2;i<=n;i++)
        {
            ll now=que.top();
            if(a[i]<=now)
                que.push(a[i]);
            else if(a[i]>now)
            {
            	cnt++;
            	if(vis[now]>0)
            	{
            		vis[now]--;
            		cnt--;
				}
				vis[a[i]]++;
                sum=sum+a[i]-now;
                que.pop();
                que.push(a[i]);
                que.push(a[i]);
             //   printf("%d ++++++\n",cnt);
            }
        }
        cout<<sum<<" "<<cnt*2<<endl;
    }
    return 0;
}