80分求调

#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;
	vector<int> a(n * m);
	for (int i = 0; i < n * m; i++) {
		cin >> a[i];
	}
	int t = a[0];
	//n为y，m为x  
	sort(a.begin(), a.end());
	int index = 0;
	for (int i = 0; i < m; i++) {
		if (i % 2 == 0) {
			for (int j = 0; j < n; j++) {
				seats[i][j].x = i;
				seats[i][j].y = j;
				seats[i][j].num = a[index++];
				if (seats[i][j].num == t) {
					cout << m - seats[i][j].x << " " << seats[i][j].y + 1 ;
					break;
				}
			}
		} else {
			for (int j = n- 1; j >= 0; j--) {
				seats[i][j].x = i;
				seats[i][j].y = j;
				seats[i][j].num = a[index++];
				if (seats[i][j].num == t) {
					cout << m - seats[i][j].x << " " << seats[i][j].y + 1 ;
					break;
				}
			}
		}
	}
	
	return 0;
}