qwq，帮帮蒟蒻调调吧。悬 2 关！

#include <map>
#include <climits>
#include <iostream>

struct data {
	int x, y, k;
};

int main() {
	int d, n, max = INT_MIN, sum = 0; std::cin >> d >> n;
	std::map<std::pair<int, int>, int> a;
	for (int x, y, k; n; --n) {
		std::cin >> x >> y >> k;
		a[{x, y}] = k;
	}
	for (int i = 0; i < 128; ++i) {
		for (int j = 0; j < 128; ++j) {
			int cnt = 0;
			for (int p = std::max(0, i - d); p <= std::min(128, i + d); ++p) {
				for (int q = std::max(0, j - d); q <= std::min(128, j + d); ++q) {
					cnt += a[{p, q}];
				}
			}
			if (cnt > max) sum = 1, max = cnt;
			else if (cnt == max) ++sum;
		}
	}
	std::cout << sum << ' ' << max;
	return 0;
}