[C++] Clean & Concise - Easy to Understand solution
Taking example as\n\n\t[[5,  2],\n\t[1,   6]]\n\n\nIt can be written as\n\n[\n\t5          5^2\n\t5^1      5^2^1^6\n]\n\n5^2^1^6 =  (5) ^ (5^1 ) ^ (5^2) ^ (6)  
Taking example as\n```\n\t[[5,  2],\n\t[1,   6]]\n```\n\nIt can be written as\n```\n[\n\t5          5^2\n\t5^1      5^2^1^6\n]\n```\n`5^2^1^6 =  (5) ^ (5^1 ) ^ (5^2) ^ (6)  == A[i][j] ^ A[i+1][j] ^ A[i][j+1] ^ matrix[i][j] `\n```cpp\nclass Solution {\npublic:\n    int kthLargestValue(vector<vector<int>>& matrix, int k) {\n        int n =matrix.size();\n        int m = matrix[0].size();\n        priority_queue<int> pq;\n        vector<vector<int>> A(n+1, vector<int>(m+1, 0));\n        for(int i=0; i<n; i++)\n        {\n            for(int j= 0;j<m; j++){\n                A[i+1][j+1] = matrix[i][j] ^ A[i][j] ^ A[i+1][j] ^ A[i][j+1];\n                pq.push(A[i+1][j+1]);       \n            }\n        }\n        int res = 0;\n        while(!pq.empty() && k > 0){\n            res = pq.top();\n            pq.pop();\n            k--;\n        }\n        return res;\n    }\n};\n```
['C']