#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  int Y[N];
  int max_y = 0;

  for (int i = 0; i < N; ++i) {
    cin >> Y[i];
    max_y = max(max_y, Y[i]);
  }
  vector<int> dp(max_y + 1, INT_MAX);
  dp[0] = 0;

  for (int i = 0; i < N; ++i) {
    int y = Y[i];
    int min_cost = INT_MAX;

    for (int j = 0; j <= max_y; ++j) {
      min_cost = min(min_cost, dp[j]);
      dp[j] = min_cost + abs(y - j);
    }
  }

  int ans = INT_MAX;

  for (int y = 1; y <= max_y; ++y) {
    ans = min(ans, dp[y]);
  }

  cout << ans << endl;

  return 0;
}