5
991 -31 -1 5 -10000000000000000000000000000000000000000000000000
-10000000000000000000000000000000000000000000000000 -31 -1 5 991
也很简单,对于10^50显然int和long都是存不下来了,那就只能用BigInteger了
对于排序,Collections里有对list的排序,这么一来就很简单了:
(这个题如果用C++写的话,鬼知道有多麻烦...)
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
String s[] = sc.nextLine().split(" ");
ArrayList<BigInteger> list = new ArrayList<BigInteger>();
for (int i = 0; i < s.length; i++) {
list.add(new BigInteger(s[i]));
}
Collections.sort(list);
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+" ");
}
}
}