调度策略

import java.util.*; public class Main {

public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    while(in.hasNextInt()){
        int n = Integer.parseInt(in.next());
        int[][] arr = new int[n][3];
        for(int i=0; i<n; i++){
            for(int j=0; j<3; j++){
                arr[i][j] = in.nextInt();
            }
        }
        System.out.println(Cost(arr));
    }
}

public static int Cost(int[][] arr){
    int cost = 0;
    int cur = -1;
    for(int i=0; i<arr.length; i++){
        int temp = Integer.MAX_VALUE;
        int index = 0;
        for(int j=0; j<3; j++){
            if(arr[i][j] <= temp && cur != j){
                temp = arr[i][j];
                index = j;
            }
        }
        cost += temp;
        cur = index;
    }
    return cost;
}

}