HW3, Problem 4:

A certain professor would like to find the best students in class.
Each student s has two associated scores:

s_n = total "normal" points earned in the class
s_b = total "brownie" points earned.  (extra credit, etc.)

Say that a student s is a best student if for no other student t, do we have
t_n > s_n and t_b >= s_b, or t_n >= s_n and t_b > s_b.

Give as efficient an algorithm possible that on input the set of students
and scores for each, outputs the set of best students.

As is the default, prove correctness, analyze, justify, etc. etc.