L1-079 天梯赛的善良 (20 分)

原题链接

#include <bits/stdc++.h>
using namespace std;
map<int, int> v;
int main()
{
    int n, x;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> x;
        v[x]++;
    }
    cout<<v.begin()->first<<" "<<v.begin()->second<<endl;
     cout<<v.rbegin()->first<<" "<<v.rbegin()->second<<endl;
}