//递推公式百度一下就有很多
//虽然据说数据很弱，只要做单调上升就能AC
//但是原则上应该
//上升和下降分别做，然后取最小值 

import java.util.*;
public class Main{

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		ArrayList<Long> al = new ArrayList<Long>();
		
		int N = s.nextInt();
		long num[] = new long[N];
		for(int i = 0; i < N; i++){
			num[i] = s.nextLong();
			if(!al.contains(num[i])){
				al.add(num[i]);
			}
		}
		
		int sz = al.size();
		long snum[] = new long[sz];
		for(int i = 0; i < sz; i++)
			snum[i] = al.get(i);
		Arrays.sort(snum);		
		
		long[][] dp = new long[2][N];
		
		for(int S = 0; S < 2; S++){
			for(int i = 0; i < N; i++){
				int n;
				if(S == 0) n = i;
				else n = N-i-1;
				
				long min = dp[S][0];
				for(int j = 0; j < sz; j++){
					min = Math.min(min, dp[S][j]);
					dp[S][j] = min + Math.abs(num[n] - snum[j]);
					if(dp[S][j] == 0) break;
//					System.out.print(dp[S][j]+"	");
				}
//				System.out.println();
			}			
//			System.out.println();
		}
		
		long min = 1000000001;
		for(int j = 0; j < sz; j++){
			min = Math.min(min, Math.min(dp[0][j], dp[1][j]));			
		}
		System.out.println(min);
	}

}