Submission #278292

---

Source Code Expand

import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        
        LinkedList<Long> list = new LinkedList<Long>();
        list.add(sc.nextLong());
        long cost = Long.MAX_VALUE;
        
        long sum = 0;
        for(int i = 1; i <= n; ++i){
            long  val = sc.nextLong();
            ListIterator<Long> iterator = list.listIterator();
            boolean addedFlag = false;
            long target = 0;
            while (iterator.hasNext()) {
                target = iterator.next();
                long diff = getDiff(target, val);
                if(cost > diff){
                    cost = diff;
                }
                
                if (target > val) {
                    iterator.previous();
                    iterator.add(val);
                    addedFlag = true;
                    break;
                }
            }
            if(!addedFlag){
                iterator.add(val);
                cost= val - target;
            }
            
            sum += cost;
        }
        
        System.out.println(sum);
        
        sc.close();
    }

    public static long getDiff(long l1, long l2) {
        if (l1 >= l2) {
            return l1 - l2;
        } else {
            return l2 - l1;
        }
    }

}

Submission Info

Judge Result