65分求掉

#include<bits/stdc++.h>
using namespace std;
int a[110], b[15][15];
bool cmp(int x, int y) {
	return x > y;
}
int main() {
	int m, n;
	scanf("%d%d", &n, &m);
	int k = m * n;
	for (int i = 1; i <= k; ++i) {
		scanf("%d", &a[i]);
	}
	int first = a[1];
	sort(a + 1, a + 1 + k, cmp);
	int t = 1;
	/*for (int j = 1; j <= m; ++j) {
		for (int i = 1; i <= n; ++i) {
			b[i][j] = a[t++];
		}
	}*/
	for (int j = 1; j <= m; ++j) {
		bool flag = true;
		if (flag) {
			for (int i = 1; i <= n; ++i) {
				b[i][j] = a[t++];
				if (b[i][j] == first) {
					printf("%d %d", j, i);
					return 0;
				}
			}
			flag = !flag;
		} else {
			for (int i = n; i >= 1; --i) {
				b[i][j] = a[t++];
				if (b[i][j] == first) {
					printf("%d %d", j, i);
					return 0;
				}
			}
			flag = !flag;
		}
	}
	return 0;
}