Решение задачи Matrix 44

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m, n, k = 0, mn = INFINITY;
    cin >> m >> n;
    vector<vector<int> > a;
    for(int i = 0; i < m; ++i){
        vector<int> t(n);
        for(int j = 0; j < n; ++j)
            cin >> t[j];
        a.push_back(t);
    }
    bool c = true;
    for(int i = 0; i < m; ++i){
        bool b = true, c = true;
        for(int j = 1; j < n; ++j){
            if(a[i][j] >= a[i][j - 1])
                c = false;
            if(a[i][j] <= a[i][j - 1])
                b = false;
        }
        if(b || c){
            for(int j = 0; j < n; ++j)
                mn = min(mn, a[i][j]);
            c = false;
        }
    }
    if(c)
        cout << 0;
    else
        cout << mn;
    return 0;
}

program Matrix44;
var
  a:array [1..10,1..10] of integer;
  M, N, i, j:Integer;
 
begin
 Write('N: ');
 Readln(N);
 Write('M: ');
 Readln(M);
 
 for  i:=1 to M do
  begin
   writeln(i,': ');
   for j:=1 to N do
    begin
     Write(j,' : ');
     Read(a[i,j]);
    end;
  end;
 
 for  i:=1 to M do
  begin
   j:=2;
   While ((a[i,j-1]<a[i,j]) and (j<=N)) do inc(j);    if j=N+1 then writeln(a[i,1])    else     begin      j:=2;      While ((a[i,j-1]>a[i,j]) and (j<=N)) do inc(j);
     if j=N+1 then writeln(a[i,N])
      else
       writeln('0');
    end;
  end;
end.