victorhez.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll mod = 1000000007;
const ll inf = 1e18;
#define all(x) begin(x), end(x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define print_array(arr)                                         \
    loop(z, sizeof(arr) / sizeof(arr[0])) cout << arr[z] << " "; \
    cout << "\n"
#define print_vector(vvv)                      \
    loop(z, vvv.size()) cout << vvv[z] << " "; \
    cout << "\n"
#define print_vector_pair(vvv)                                             \
    loop(z, vvv.size()) cout << vvv[z].first << " " vvv[z].second << "\n"; \
    cout << "\n";
#define fill_my(arr, q) fill(all(arr), q)

void solve(int n)
{
    unordered_map<int, int> map;

    for (int i = 0; i < n; i++)
    {
        int num;
        cin >> num;
        map[num]++;
    }

    int length = map.size();
    vector<pair<int, int>> v(length);

    for (auto x : map){
        v[length-1].first=x.first;
        v[length-1].second=x.second;
        length=length-1;
    }
    // print_vector_pair(v);
    for (int i = 0; i < v.size(); i++)
    {
        cout<<v[i].first<<" "<<v[i].second<<endl;
    }
    

    // for (auto i = map.begin(); i < map.end(); i++)
    // {
    //     // auto x=map[i];
    //     cout << map[i].first << " " << map[i] << endl;
    // }

// for (auto it = map.end(); it >= map.begin(); it++) { 
//         cout << "(" << it->first << ", " 
//              << it->second << ")" << endl; 
//     } 

}

int main()
{
    clock_t time_req;
    time_req = clock();
    cin.sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    solve(n);

    // time_req = clock() - time_req;
    // cout << "\nProcessor time " << (float)time_req / CLOCKS_PER_SEC<< " sec" << endl;
    return 0;
}