Import Java.util.Scanner;
public class Tesww {
public static void Main (string[] args) {
Scanner reader=new Scanner (system.in);
int N=reader.nextint ();
int [][]a =new int[n][2];
for (int i=0;i<n;i++) {
for (int j=0;j<2;j++) {
A[i][j]=reader.nextint ();
}
}
Sort (A,n); Sort by interval Hu right boundary
int count=1;
int [][]result =new int [n][2];
int max=a[0][1];
RESULT[0][1]=A[0][1];
RESULT[0][0]=A[0][0];
for (int i=1;i<n;i++) {
if (A[i][0]<max) {
Continue
}
else{
MAX=A[I][1];
RESULT[COUNT][0]=A[I][0];
RESULT[COUNT][1]=A[I][1];
count++;
}
}
System.out.println ("Max" +count+ "non-repeating interval:");
for (int i=0;i<count;i++) {
System.out.println ("" "+result[i][0]+" "+result[i][1]+" "");
}
}
public static void Sort (int[][] A, int n) {
for (int i=0;i<n;i++) {
for (int j=i;j<n;j++) {
if (A[j][1]<a[i][1]) {
int temp[]=new int [2];
TEMP=A[J];
A[j]=a[i];
A[i]=temp;
}
}
}
}
}
Java statistics maximum number of disjoint intervals (used: Customers who have the most appointments in a day)