Programming Competition | Editorial by aksingh007

Create an integer that will store the maximum number of questions that any programmer might have solved during the competition. 
Initialize it to a negative value so that it will updated even if no programmer has solved any question at all. 
Create a string in order to store the name of the winner.
While reading the programmers names and the number of questions that they have solved, compute the number of questions that they have 
solved during the competition (nr of questions solved until January - nr of questions solved until December) and then check if the difference is 
greater than the current maximum that we have. If yes, update the maximum and the name of the current winner as well.
In the end, output the name of the winner and the number of maximum questions that he/she has solved.

```
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class S implements Comparable<S>{
    String name;int diff;int pos;
    S(String nm,int d,int p){
        name=nm;diff=d;pos=p;
    }
    public int compareTo(S obj){
        if(this.diff!=obj.diff)
            return obj.diff-this.diff;
        else
            return this.pos-obj.pos;
    }
}

public class Solution {

public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        ArrayList<S> arr=new ArrayList<S>();
        for(int a0 = 0; a0 < n; a0++){
            String name = in.next();
            int d = in.nextInt();
            int j = in.nextInt();
            arr.add(new S(name,j-d,a0));
        }
        Collections.sort(arr);
        System.out.println(arr.get(0).name+" "+arr.get(0).diff);
        in.close();
    }
}

```

Programming Competition | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?