[백준]1261번문제
#include #include #include using namespace std; const int MAX = 100;typedef pair pi; int main(){ int M,N,table[MAX+1][MAX+1]={0},dis[MAX+1][MAX+1]={0}; priority_queue pq; scanf("%d %d",&M,&N); for(int i =0 ; i < N ; i ++){ for(int j =0 ; j < M ; j++){ scanf("%1d",&table[i][j]); dis[i][j]=1