题目:https://www.luogu.com.cn/problem/P1097
思路:
1. 由于最大数据来到 1.5 * 10^9 次方,无法直接开数组(①空间不允许开那么大的数组;②太浪费空间了,最后输出也很麻烦),于是采用map
2. 在map创建中,注意加个自定义的比较排序函数就ok了
代码如下:
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
struct MyCompare {
bool operator()(const long long& a, const long long& b) const {
return a < b;
}
};
int n;
long long x;
map <long long, long long, MyCompare> num;
int main ( )
{
scanf ( "%d", &n );
for ( int i = 0; i < n; ++ i ) {
scanf( "%lld", &x );
if ( num.find(x) != num.end() ) {
++ num[ x ];
}
else{
num[ x ] = 1;
}
}
for ( auto it : num ) {
cout << it.first << " " << it.second << endl;
}
return 0;
}
道阻且长,与君共勉