1 条题解
-
0
#include<bits/stdc++.h> using namespace std; vector<long long> vec[10010]; long long A[10010]; int main(){ int n; cin >> n; for (int i = 1; i <= n ; i++){ cin >> A[i]; } for (int i = 1; i <= n; i ++){ int sum = 0; long long t = A[i]; while(t){ sum += t % 10; t /= 10; } vec[sum].push_back(A[i]); } int maxx = -1;//记录的是最多人数的组是多少 int maxid = -1;//记录最多人数的组的编号是多少 for (int i = 1; i <= 81; i ++){ //cout << vec[i].size() << endl; if(maxx < (int)vec[i].size()){ maxx = vec[i].size(); maxid = i; // cout << "t" << endl; } } //cout << maxx << " " << maxid; cout << maxid << endl; sort(vec[maxid].begin(), vec[maxid].end(), greater<long long>()); for (int i = 0; i < vec[maxid].size(); i ++){ cout << vec[maxid][i] << " "; } return 0; }
信息
- ID
- 135
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 7
- 标签
- (无)
- 递交数
- 148
- 已通过
- 34
- 上传者