from heapq import*
input()
s,h=0,[]
for v in map(int,input().split()):
heappush(h,v)
if v>h[0]:s+=v-heapreplace(h,v)
print(s)#include<bits/stdc++.h>
using namespace std;
int n,p[300005];
priority_queue<int,vector<int>,greater<int>> q;
long long ans;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>p[i];
}
for(int i=1;i<=n;i++){
if(!q.empty() && q.top()<p[i]){
ans+=(p[i]-q.top());
q.pop();
q.push(p[i]);
}
q.push(p[i]);
}
cout<<ans<<endl;
return 0;
}787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |