Gradebook Top Student

Each row of scores holds one student's test scores. Compute each student's average with a helper function and return the row index of the student with the highest average. If several tie, return the smallest index.

Implement top_student(scores).

Input

scores: One row of scores per student; every row has at least one score.

Output

Return the index of the top student.

Contraintes

1 ≤ students ≤ 1,000; 1 ≤ scores per student ≤ 100; 0 ≤ score ≤ 100

Exemples

Entrée :
scores = [
    [80, 90],
    [95, 85],
    [70, 100]
]

Sortie attendue :
expected = 1

Entrée :
std::vector<std::vector<long long>> scores = {
    {80, 90},
    {95, 85},
    {70, 100}
};

Sortie attendue :
long long expected = 1;

Entrée :
long[][] scores = new long[][] {
    new long[] {80, 90},
    new long[] {95, 85},
    new long[] {70, 100}
};

Sortie attendue :
long expected = 1;

Entrée :
scores = [
    [60],
    [60, 60]
]

Sortie attendue :
expected = 0

Entrée :
std::vector<std::vector<long long>> scores = {
    {60},
    {60, 60}
};

Sortie attendue :
long long expected = 0;

Entrée :
long[][] scores = new long[][] {
    new long[] {60},
    new long[] {60, 60}
};

Sortie attendue :
long expected = 0;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Fordham CS1600 Computer Science I - schedule and labs