Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
kth smallest element in a matrix
int kthSmallest(int mat[MAX][MAX], int n, int k) { //Your code here priority_queue<int>pq; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { pq.push(mat[i][j]); if(pq.size()>k) { pq.pop(); } } } return pq.top(); }
run
|
edit
|
history
|
help
0
Wipro Problem 1: generate roll number
Yo que se
union of two sorted array
an awesome question of basic graph traversal (786A)
Good1
on_off
basic caculate ii
GenericPacker
顺序表的实现——静态分配
vector destruction - gcc