第一题： import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class huaw1 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = scan.nextInt(); int[][] arr = new int[m][3]; for (int k = 0;k<m;k++){ arr[k][0] = scan.nextInt(); arr[k][1] = scan.nextInt(); arr[k][2] = scan.nextInt(); } Arrays.sort(arr,(a,b)->a[2]-b[2]); int cost = 0; A: for (int i = 1;i<=n;i++){ for (int j =0;j<m;j++){ if (i>=arr[j][0]&;&;i<=arr[j][1]){ cost = cost+arr[j][2]; //long s1 = arr[j][1]; continue A; } } } System.out.println(cost); } }