Task 7 of 7 · 0 solved · 7 to go0%
You can read the problem, but answers are checked only for signed-in students. Sign in to answer →

Problem

8.2 Comparable — capstone: rank the students

Write a complete program with a class Student that implements Comparable<Student>, ordering students by score, lowest first. Give it a toString returning name(score).

Read a count and then that many name/score pairs. Print the sorted list, then the highest scorer, then the lowest.

For 3 then Ada 90 Sam 55 Bo 70:

[Sam(55), Bo(70), Ada(90)]
Ada(90)
Sam(55)

Once compareTo exists, Collections.sort, max and min all work without another line from you.

time 1000 ms memory 256 Mb
Solution
Attempts: 0 A hint guides you to the fix — it never writes the code for you.
✦
Ready to check

Press «Submit» to run your code against the task's test cases — that is what sets your score. «AI review» is an optional second opinion: it reads your code — logic and style, not just the output — and suggests the next step without handing over the answer. It never changes your score.

Next module →
Working…