题目链接:攀爬者
java代码:
import java.util.Arrays; import java.util.Scanner; class Point implements Comparable{ int x; int y; int z; public Point(int x, int y, int z) { this.x = x; this.y = y; this.z = z; } public int compareTo(Point newPoint) { return Integer.compare(this.z, newPoint.z); } } public class Main { public static void main(String[] args) { int n; double result = 0.0; Scanner in = new Scanner(System.in); n = in.nextInt(); Point arr[] = new Point[n]; for(int i=0;i 欢迎分享,转载请注明来源:内存溢出
评论列表(0条)