#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int> Y(N), a(N);
	vector<int> dp(N, 0);
	rep(i, N) {
		cin >> Y[i];
		a[i] = Y[i];
	}
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()), a.end());
	rep(i, N){
		int t = dp[0];
		rep(j, a.size()){
			t = min(t, dp[j]);
			dp[j] = t + abs(Y[i] - a[j]);
		}
	}
	cout << *min_element(dp.begin(), dp.end()) << endl;
	return 0;
}