不会什么排序方法编号;
运用土办法编号;
还待优化;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
double n = sc.nextDouble();
double m = 0;
double h = n - 1;
double x[] = new double[(int) n];
double y[] = new double[x.length]; //记录每个数据的编号
int z[] = new int[x.length]; //记录每个数据的编号是否输出
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
y[i] = x[i];
}
Arrays.sort(x);
for (int i = 0; i < n; i++) { //”踏踏实实“的方法
for (int j = 0; j < n; j++) {
if (y[j] == x[i] && z[j] == 0) {
if (i == n - 1) {
System.out.println(j + 1);
} else {
System.out.print(j + 1+" ");
}
z[j] = 1;
break; //去重,防止运算过大;
}
}
}
for (int i = 0; i < n; i++) {
m += x[i] * (h--); //等待总时间
}
System.out.println(String.format("%.2f", m / n));
}
}
}