题解 | #有序序列合并#
矩阵元素定位
http://www.nowcoder.com/practice/b8e6a46992fe4e11b2822b20561b6d94
}#include <iostream> using namespace std; int main() { int n,m,x,y; cin>>n>>m; int arr[n][m]; for (int i=0;i<n;i++) for (int j=0;j<m;j++) { cin>>arr[i][j]; } cin>>x>>y; cout<<arr[x-1][y-1]; }
cin>>x>>y; cout<<arr[x-1][y-1];
}