@@ -0,0 +1,780 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        int%5B%5D score = new int%5Bn%5D;%0A        for(int score_i=0; score_i %3C n; score_i++)%7B%0A            score%5Bscore_i%5D = in.nextInt();%0A        %7D%0A        int countH = 0,countL=0;%0A        int max=score%5B0%5D;%0A        int min=score%5B0%5D;%0A        for(int i=1;i%3Cscore.length;i++)%7B%0A            if(score%5Bi%5D%3Emax)%7B%0A                max=score%5Bi%5D;%0A                countH++;%0A            %7D%0A            if(score%5Bi%5D%3Cmin)%7B%0A                min=score%5Bi%5D;%0A                countL++;%0A            %7D%0A        %7D%0A        System.out.println(countH+%22 %22+countL);%0A    %7D%0A%7D%0A

add BreakingTheRecords.java