输入第一行包括1个整数N,1<=N<=1000,代表输入数据的个数。 接下来的一行有N个整数。
可能有多组测试数据,对于每组数据, 第一行输出一个整数,代表N个整数中的最大值,并将此值从数组中去除,将剩下的数进行排序。 第二行将排序的结果输出。
4 1 3 4 2
4 1 2 3
import java.io.*; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); ArrayList<Integer> li = new ArrayList<>(); int n = Integer.parseInt(br.readLine()); String[] str = br.readLine().split(" "); int len = str.length; for (int i = 0; i < len; i++) { li.add(Integer.parseInt(str[i])); } li.sort(new Comparator<Integer>() { @Override public int compare(Integer o1, Integer o2) { return o1 > o2 ? 1 : -1; } }); System.out.println(li.remove(li.size() - 1)); if (!li.isEmpty()) { for (Integer i : li) { System.out.print(i + " "); } } else System.out.println(-1); } }
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) arr[i] = scanner.nextInt(); Arrays.sort(arr); System.out.println(arr[n-1]); if (n>1) for (int i = 0; i < arr.length - 1; i++) System.out.print(arr[i]+" "); else System.out.println("-1"); } }
import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); if(1 == n){ System.out.println(sc.nextInt()); System.out.println("-1"); return; } int[] nums = new int[n]; for(int i=0;i<n;i++){ nums[i] = sc.nextInt(); } Arrays.sort(nums); System.out.println(nums[n-1]); for(int i=0;i<n-1;i++){ System.out.print(nums[i]+" "); } } } }
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = scan.nextInt();
int[] data = new int[n];
for (int i = 0; i < data.length; i++) {
data[i] = scan.nextInt();
}
if (n == 1) {
System.out.println(data[0]);
System.out.println(-1);
} else {
Arrays.sort(data);
int[] output = new int[n - 1];
System.arraycopy(data, 0, output, 0, n - 1);
System.out.println(data[data.length - 1]);
for (int i = 0; i < output.length - 1; i++) {
System.out.print(output[i] + " ");
}
System.out.println(output[output.length - 1]);
}
}
}
}