Jump in rank of a student after updating marks

Given three arrays names[], marks[] and updates[] where:

1. names[] contains the names of students.
2. marks[] contains the marks of the same students.
3. updates[] contains the integers by which the marks of these students are to be updated.

The task is find the name of the student with maximum marks after updation and the jump in the student’s rank i.e. previous rank – current rank.
Note: The details of the students are in descending order of their marks and if more than two students scored equal marks (also the highest) then choose the one who had a lower rank previously.

Examples:

Input: names[] = {“sam”, “ram”, “geek”, “sonu”},
marks[] = {99, 75, 70, 60},
updates[] = {-10, 5, 9, 39}
Output: Name: sonu, Jump: 3
Updated marks are {89, 80, 79, 99}, its clear that sonu has the highest marks with jump of 3

Input: names[] = {“sam”, “ram”, “geek”},
marks[] = {80, 79, 75},
updates[] = {0, 5, -9}
Output: Name: ram, Jump: 1

Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: Create a structure struct Student to store the information of each student, each of which will have 3 attributes name of the student, marks of the student, prev_rank of the student.
Now, updated the marks according to the content of the updates[] then with a single traversal of the array, find the student who has the highest marks after updation.

Below is the implementation of the above approach:

 // C++ implementation of the approach #include using namespace std;    // Structure to store the information of // students struct Student {     string name;     int marks = 0;     int prev_rank = 0; };    // Function to print the name of student who  // stood first after updation in rank void nameRank(string names[], int marks[],                        int updates[], int n) {     // Array of students     Student x[n];        for (int i = 0; i < n; i++) {            // Store the name of the student         x[i].name = names[i];            // Update the marks of the student         x[i].marks = marks[i] + updates[i];            // Store the current rank of the student         x[i].prev_rank = i + 1;     }        Student highest = x;     for (int j = 1; j < n; j++) {         if (x[j].marks >= highest.marks)             highest = x[j];     }        // Print the name and jump in rank     cout << "Name: " << highest.name          << ", Jump: "           << abs(highest.prev_rank - 1)           << endl; }    // Driver code int main() {     // Names of the students     string names[] = { "sam", "ram", "geek" };        // Marks of the students     int marks[] = { 80, 79, 75 };        // Updates that are to be done     int updates[] = { 0, 5, -9 };        // Number of students     int n = sizeof(marks) / sizeof(marks);        nameRank(names, marks, updates, n); }

Output:

Name: ram, Jump: 1

My Personal Notes arrow_drop_up 