CF865D Buy Low Sell High(反悔自动机)

eva_can(not)survive

于 2022-05-10 00:14:14 发布

阅读量145

点赞数

分类专栏：洛谷学习随学

本文链接：https://blog.csdn.net/Ghostttttttiii/article/details/124678703

版权

c++ 算法

洛谷学习同时被 2 个专栏收录

202 篇文章 0 订阅

订阅专栏

随学

64 篇文章 0 订阅

订阅专栏

Buy Low Sell High - 洛谷https://www.luogu.com.cn/problem/CF865D

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n;
ll p[MAXN];
priority_queue<ll, vector<ll>, greater<ll> > que;

int main() {
	ll ans = 0;
	ll x;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &x);
		if (!que.empty() && x > que.top()) {
			ans += x - que.top();
			que.pop();
			que.push(x);
		}
		que.push(x);
	}
	printf("%lld", ans);
	return 0;
}