@luogu_hezhenmin1
  • 板块灌水区
  • 楼主liuzhuoran141516
  • 当前回复1
  • 已保存回复1
  • 发布时间2024/10/11 11:27
  • 上次更新2024/10/11 15:56:18
查看原帖
@luogu_hezhenmin1
1351155
liuzhuoran141516楼主2024/10/11 11:27
#include <bits/stdc++.h>
using namespace std;
struct Class {
	int Chess, Programming, y, m, d, all;
}a[3005][13][32], maxone;
int n, m;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) {
		int n1, n2, n3;
		cin >> n1 >> n2 >> n3;
		a[n1][n2][n3].Chess ++;
		a[n1][n2][n3].all ++;
		a[n1][n2][n3].y = n1;
		a[n1][n2][n3].m = n2;
		a[n1][n2][n3].d = n3;
	}
	for (int i = 1; i <= m; i ++) {
		int n1, n2, n3;
		cin >> n1 >> n2 >> n3;
		a[n1][n2][n3].Programming ++;
		a[n1][n2][n3].all ++;
		a[n1][n2][n3].y = n1;
		a[n1][n2][n3].m = n2;
		a[n1][n2][n3].d = n3;
	}
	int maxn = 0;
	for (int i = 1; i <= 3000; i ++) {
		for (int j = 1; j <= 12; j ++) {
			for (int k = 1; k <= 30; k ++) {
				if (a[i][j][k].all > maxn) {
					maxone = a[i][j][k];
					maxn = a[i][j][k].all;
				}
			}
		}
	}
	cout << maxone.y << ' ' << maxone.m << ' ' << maxone.d << ' ' << maxone.Chess << ' ' << maxone.Programming;
	return 0;
}
2024/10/11 11:27
加载中...