sort marks in descending order.txt

Monk is a multi-talented person, and prepares results for his college in his free time. (Yes, he is still in love with his old college!) He gets a list of students with their marks. The maximum marks which can be obtained in the exam is 100.

The Monk is supposed to arrange the list in such a manner that the list is sorted in decreasing order of marks. And if two students have the same marks, they should be arranged in lexicographical manner.

Help Monk prepare the same!

Input format:
On the first line of the standard input, there is an integer N, denoting the number of students. N lines follow, which contain a string and an integer, denoting the name of the student and his marks.

Output format:
You must print the required list.

Constraints:
1 <= N <= 105
1 <= | Length of the name | <= 100
1 <= Marks <= 100

Sample Input
3
Eve 78
Bob 99
Alice 78
Sample Output
Bob 99
Alice 78
Eve 78




#include <bits/stdc++.h>
using namespace std;
int main()
{
    map<int, multiset<string>> marks_map;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int marks;
        string name;
        cin >> name >> marks;
        marks_map[marks].insert(name);
    }

    auto cur_it = --marks_map.end(); // to reverse the map

    while (true)
    {
        auto &students = (*cur_it).second;
        auto &name = (*cur_it).first;
        for(auto student : students)
        {
            cout << student << marks << endl;
        }
    }
    if(cur_it == marks_map.begin()) break;
    cur_it--;
}








#include <bits/stdc++.h>
using namespace std;
int main()
{
    map<int, multiset<string>> marks_map;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int marks;
        string name;
        cin >> name >> marks;
        marks_map[-1*marks].insert(name);
    }


    for(auto &marks_student_pr : marks_map)
    {
        auto &students = marks_student_pr.second;
        int marks = marks_student_pr.second;
        for(auto student: students)
        {
            cout << student << " " << -1*marks << endl;
        }
    }
}
















#include <bits/stdc++.h>
using namespace std;

bool compare(pair<string,int>p , pair<string,int> q)
{
    if(p.second == q.second)
    {
      return p.first < q.first;
    }
    return p.second > q.second;
}

int main()
{
    int t;
    cin >> t;
    vector < pair<string,int> >v;
    while(t--)
    {
        int n;
        string s;
        cin >> s >> n ;
        v.push_back({s,n});
    }

    sort(v.begin() , v.end() ,compare);

    for(int i = 0 ; i< v.size(); i++)
    {
        cout << v[i].first << " " << v[i].second << endl;
    }
}