{ 90, 65, 82, 31, 7 } };
int[] arr1 = new int[5];
//计算一维数组得和
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
arr1[i]=arr[i][j]+arr1[i];
}
}
//冒泡排序降序排一维数组
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i+1; j < arr.length ; j++) {
int temp;
if(arr1[i]<arr1[j]){
temp=arr1[j];
arr1[j]=arr1[i];
arr1[i]=temp;
int[] d=arr[i];
arr[i]=arr[j];
arr[j]=d; }
}
}
for (int i = 0; i < arr.length; i++) {
Arrays.sort(arr[i]);
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}