#include<iostream> using namespace std; #define N 200005 int n, a[N], ct, num; void quickSort(int l, int r) { if(l >= r) return; int pivot = a[rand()%(r-l+1)+l], i = l, j = r; while(i <= j) { while(a[i] < pivot) i++; while(a[j] > pivot) j--; if(i <= j) { swap(a[i], a[j]); i++, j--; } } quickSort(l, j); quickSort(i, r); } int main() { srand(time(NULL)); cin >> n; for(int i = 1; i <= n; ++i) //cin >> a[i]; scanf("%d",&a[i]); quickSort(1, n); num = a[1];//当前在看的数字 for(int i = 1; i <= n; ++i) { if(a[i] == num) ct++; else { cout << num << ' ' << ct << endl; ct = 1; num = a[i]; } } printf("%d %d",num,ct); //cout << num << ' ' << ct << endl; return 0; }