C. Sequence

二倍经验 待补：Sonya and Problem Wihtout a Legend
C. Sequence
题意：给定一个序列，每次操作可以把某个数+1或-1。要求把序列变成非降数列的最小操作数。

//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include
#define int long long
#define fi first
#define se second
#define pii pair
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=2e18+100;
const int maxn=2e5+100;
signed main()
{
	IOS
	priority_queueq;
	int ans=0;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		q.push(x);
		if(x