#include <iostream> #include <map> #include <vector> #include <set> using namespace std; int main() { int m; cin >> m; while (m--) { int n, t; cin >> n; map<int, vector<int>> mp; set<...

#include <iostream> using namespace std; const int N = 1e5 + 10; int m, n, x, a[N], map[110][N]; int c[N]; int main() { cin >> m; while (m -- ) { cin >> n; for (int i = 1; i <= n; i ++ ) { cin >> a[i]; map[0][a[i]] ++; } int p ...

#include<iostream> #include<cstdlib> using namespace std; int main() { int m; cin >> m; while (m--) { int n; cin >> n; int* anum = new int[n];//存数 int* agrp = new int[n];//存组 int maxn = -1, maxg = -1;//存最大数和最大组 for (int i = 0; i < n; i++...