You can perfectly predict the price of a certain stock for the next N
days. You would like to profit on this knowledge, but only want to
transact one share of stock per day. That is, each day you will either
buy one share, sell one share, or do nothing. Initially you own zero
shares, and you cannot sell shares when you don’t own any. At the end
of the N days you would like to again own zero shares, but want to
have as much money as possible.
Input
Input begins with an integer N (2 ≤ N ≤ 3·105), the number of
days.
Following this is a line with exactly N integers p1, p2, …, pN
(1 ≤ pi ≤ 106). The price of one share of stock on the i-th day is
given by pi.
Output
Print the maximum amount of money you can end up with at the
end of N days.
1。用优先队列进行贪心,每次遇到更大的数就进行交换,用中间数做跳板;
2。学习优先队列的定义方式;
#include<bits/stdc++.h>
using namespace std;
//struct cmp1{
// bool operator ()(int &a,int &b){
// return a>b;
// }
//};
priority_queue<int, vector<int>, greater<int> > q;
//priority_queue<int,vector<int> ,cmp1> q;
int main()
{
int n;
scanf("%d",&n);
long long sum=0;
for(int i=0;i<n;i++){
int t;
scanf("%d",&t);
q.push(t);
if(q.top() < t && q.size()){
sum += t - q.top();
q.pop();
q.push(t);
}
}
printf("%lld",sum);
return 0;
}