Borman

#include <iostream>
using namespace std;
class Graph
{
  private: int n, m;
  int arr[10][10];
  int visited[10];
  protected:
  public:
    Graph()
     {
      n=10;
      m=0;
      for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
         arr[i][j]=0;
     }

    Graph (int a, int b)
   {
    n=a;
   int l, min =10000, visited[n], text[3];
      for (int i=0; i<n; i++)
         for (int j=0; j<n; j++)
          cin >> arr[i][j];

     for (int i=0; i<n; i++)
      {
         for (int j=0; j<n; j++)
             if ((arr[i][j]<=min) && (arr[i][j]!=0))
              {
               min = arr[i][j];
              }
              visited[i]=min;
              min=10000;
      }
      for (int j=0; j<3; j++)
       {
         for (int i=0; i<n; i++)
        if ((visited[i]<min) && (visited[i]!=0))
         {
          min = visited[i];
          l=i;
         }
         cout << l+1 << " ";
         visited[l]=0;
         min =1000;
       }
   }
};

int main()
{
  Graph Borman;
  int a, b=0;
  cin >> a;
  Borman = Graph(a, b);
}