vjudge solution map vector related

 problem : https://vjudge.net/contest/368330#problem/C

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

template <class type1>

#define ll long long int

#define endl "\n"

#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>

using ordered_multiset = tree <type1, null_type, less_equal <type1>, rb_tree_tag, tree_order_statistics_node_update>;

 //ordered_multiset <ll> kek;(declaration for multiorder set)

// ordered_set o_set;(declaration)

//kek.order_of_key(i);(strictly less then i for multi order set)

//o_set.order_of_key(5) ;(strictly less then i for multi order set)

#define yes cout << "YES\n"

#define no cout << "NO\n"

int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

     map<ll,vector<ll>>vp;

     ll t;

     cin>>t;

    vector<ll>v;

     while(t--)

     {

       

         ll id,m;

         cin>>id>>m;

         vp[m].push_back(id);

         if(vp[m].size()<=1)

         v.push_back(m);

         

     }

     sort(v.rbegin(),v.rend());

     for(ll i=0;i<v.size();i++)

     {

           ll r;

           r=v[i];

           for(ll j=0;j<vp[r].size();j++)

           {

              cout<<vp[r][j]<<" "<<r<<endl;

           }

     }

     

    return 0;

}