POJ 3666（dp

import java.util.*;
import java.math.*;
import java.io.*;
public class Main {
    public static final int maxv=2000+40;
    public static void main(String[] args) throws Exception {
        Scanner in = new Scanner(new File("/home/develop/eclipse_file/ACMproject/src/in"));
        // Scanner in=new Scanner(System.in);
        int[][] dp=new int[maxv][maxv];
        int N;
        N=in.nextInt();
        int[] a=new int[N];
        int[] b=new int[N];
        for(int i=0;i<N;i++){
            a[i]=in.nextInt();
            b[i]=a[i];
        }
        Arrays.sort(b);
        for(int i=0;i<N;i++) dp[0][i]=Math.abs(a[0]-b[i]);
        for(int i=1;i<N;i++){
            int pre=dp[i-1][0];
            for(int j=0;j<N;j++){
                pre=Math.min(pre, dp[i-1][j]);
                dp[i][j]=Math.abs(a[i]-b[j])+pre;
            }
        }
        int ans=(int)1e9;
        for(int i=0;i<N;i++){
            ans=Math.min(ans, dp[N-1][i]);
        }
        System.out.println(ans);
        in.close();
    }
}