import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class SORT {
public static void main(String[] args) {
Point[] arr;
arr=new Point[4]; //定义对象数组arr,并分配存储的空间
for(int i=0;i<4;i++)
arr[i]=new Point();
Scanner input = new Scanner(System.in);
for(int i=0;i<4;++i){
arr[i].x=input.nextInt();
arr[i].y=input.nextInt();
}
MyComprator cmp = new MyComprator();
Arrays.sort(arr, cmp); //使用指定的排序器,进行排序
for(int i=0;i<4;i++) //输出排序结果
System.out.println("("+arr[i].x+","+arr[i].y+")");
}
}
class Point{
int x;
int y;
}
//比较器,x坐标从小到大排序;x相同时,按照y从小到大排序
class MyComprator implements Comparator {
public int compare(Object arg0, Object arg1) {//compare函数一定要实现
Point t1=(Point)arg0;
Point t2=(Point)arg1;
if(t1.x != t2.x)
return t1.x>t2.x? 1:-1;
else
return t1.y>t2.y? 1:-1;
}
}
import java.util.Comparator;
import java.util.Scanner;
public class SORT {
public static void main(String[] args) {
Point[] arr;
arr=new Point[4]; //定义对象数组arr,并分配存储的空间
for(int i=0;i<4;i++)
arr[i]=new Point();
Scanner input = new Scanner(System.in);
for(int i=0;i<4;++i){
arr[i].x=input.nextInt();
arr[i].y=input.nextInt();
}
MyComprator cmp = new MyComprator();
Arrays.sort(arr, cmp); //使用指定的排序器,进行排序
for(int i=0;i<4;i++) //输出排序结果
System.out.println("("+arr[i].x+","+arr[i].y+")");
}
}
class Point{
int x;
int y;
}
//比较器,x坐标从小到大排序;x相同时,按照y从小到大排序
class MyComprator implements Comparator {
public int compare(Object arg0, Object arg1) {//compare函数一定要实现
Point t1=(Point)arg0;
Point t2=(Point)arg1;
if(t1.x != t2.x)
return t1.x>t2.x? 1:-1;
else
return t1.y>t2.y? 1:-1;
}
}