leetcode

0 class Solution {

1 public:

2 int kthLargestValue(const vector<vector<int>> &matrix, int k) {

3 static int crnt[1001], prev[1001];

4 const int n = matrix.size(), m = matrix[0].size();

5 priority_queue<int> pq;

6

7 memset(prev, 0x00, sizeof(prev));

8 for (int i = 0; i < n; i++) {

9 memset(crnt, 0x00, sizeof(crnt));

10 pq.push(crnt[0] = prev[0] ^ matrix[i][0]);

11 for (int j = 1; j < m; j++) {

12 crnt[j] = matrix[i][j] ^ prev[j] ^ crnt[j - 1] ^ prev[j - 1];

13 pq.push(crnt[j]);

14 }

15 swap(prev, crnt);

16 }

17

18 while (--k)

19 pq.pop();

20 return pq.top();

21 }

22 };