#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
	}
	vector<int> comp = A;
	sort(comp.begin(), comp.end());
	comp.erase(unique(comp.begin(), comp.end()), comp.end());
	int S = comp.size();
	vector<int> dp(S);
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < S; ++j) {
			dp[j] += abs(A[i] - comp[j]);
		}
		for (int j = 1; j < S; ++j) {
			dp[j] = min(dp[j], dp[j - 1]);
		}
	}
	cout << dp[S - 1] << endl;
	return 0;
}