#define  _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(20);
}


#define int ll

unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

int seg_tree[seg_size * 2];
int seg_find(int now, int n_l, int n_r, int w_l, int w_r) {
    if (w_l <= n_l && n_r <= w_r) return seg_tree[now];
    if (w_r <= n_l || n_r <= w_l) return 0;
    return max(seg_find(now * 2, n_l, (n_l + n_r) / 2, w_l, w_r),
        seg_find(now * 2 + 1, (n_l + n_r) / 2, n_r, w_l, w_r));
}

void seg_set(int now) {
    seg_tree[now] = max(seg_tree[now * 2], seg_tree[now * 2 + 1]);
    if (now > 1) seg_set(now / 2);
    return;
}

void solve() {
    int n;
    cin >> n;
    vector<int> inputs(n);
    int ans = 0;
    REP(i, n) {
        cin >> inputs[i];
        ans += inputs[i];
    }
    REP(i, n) {
        seg_tree[(seg_size + inputs[i])] = seg_find(1, 0, seg_size, 0, inputs[i]) + inputs[i];
        seg_set((seg_size + inputs[i]) / 2);
    }
    cout << ans - seg_tree[1] << endl;
}

#undef int
int main() {
    init();
    solve();
}
