SDNU 1185.统计数字（水题）

#include <cstdio>
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#define ll long long

int n;
ll num[200000+8];

map<ll, int>mp;

struct node
{
    ll sign;
    int time;
}r[200000+8];

bool cmp(node a, node b)
{
    return a.sign<b.sign;
}

int main()
{
    scanf("%d", &n);
    ll x;
    for(int i = 0; i<n; i++)
    {
        scanf("%lld", &x);
        if(!mp[x])mp[x] = 1;
        else mp[x]++;
    }
    map<ll, int>::iterator ii;
    int miao = 0;
    for(ii = mp.begin(); ii != mp.end(); ii++)
    {
        r[miao].sign = ii->first;
        r[miao].time = ii->second;
        miao++;
    }
    sort(r, r+miao, cmp);
    for(int i = 0; i<miao; i++)
        printf("%lld %d\n", r[i].sign, r[i].time);
    return 0;
}