#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

#define N 2001

#define abs(x) ((x) < 0 ? -(x) : (x))

#define min(x, y) ((x) < (y) ? (x) : (y))

int n, ans = ~(1 << 31);

int a[N], b[N], f[N][N][2];

//f[i][j]表示前i个数，第i个数为b[j]的最优解

//0表示不下降，1表示不上升 

inline int read()

{

	int x = 0, f = 1;

	char ch = getchar();

	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -1;

	for(; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';

	return x * f;

}

int main()

{

	int i, j, sum;

	n = read();

	for(i = 1; i <= n; i++) a[i] = b[i] = read();

	std::sort(b + 1, b + n + 1);

	memset(f, 127, sizeof(f));

	memset(f[0], 0, sizeof(f[0]));

	for(i = 1; i <= n; i++)

	{

		sum = ~(1 << 31);

		for(j = 1; j <= n; j++)

		{

			sum = min(sum, f[i - 1][j][0]);

			f[i][j][0] = min(f[i][j][0], sum + abs(a[i] - b[j]));

		}

		sum = ~(1 << 31);

		for(j = n; j >= 1; j--)

		{

			sum = min(sum, f[i - 1][j][1]);

			f[i][j][1] = min(f[i][j][1], sum + abs(a[i] - b[j]));

		}

	}

	for(i = 1; i <= n; i++)

		ans = min(ans, min(f[n][i][0], f[n][i][1]));

	printf("%d\n", ans);

	return 0;

}