15分求调

#include<bits/stdc++.h>
using namespace std;

struct seat {
	int x, y;
	int num;
} seats[105][105];

int main() {
	int n, m;
	cin >> n >> m;
	int a[105*105];
	for (int i = 0; i < n * m; i++) {
		cin >> a[i];
	}
	int t = a[0];
	int b[105*105];
	for(int i=0;i<n*m;i++){
		b[i]=a[i];    
	}
	sort(a, a + n * m);
	int index = 0;
	
	for (int i = 0; i < n; i++) {
		if (i % 2 == 0) {
			for (int j = 0; j < m; j++) {
				seats[i][j].x = i;
				seats[i][j].y = j;
				seats[i][j].num = b[index++];
			}
		} else {
			for (int j = m - 1; j >= 0; j--) {
				seats[i][j].x = i;
				seats[i][j].y = j;
				seats[i][j].num = b[index++];
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (seats[i][j].num == t) {
				cout << seats[i][j].y+1 << " " << n-seats[i][j].x;
			}
		}
	}
	return 0;
}