os-lab-program-c++ program to banker's algorithm

#include <iostream>
using namespace std;
  
int main()
{
  int n, m, i, j, k;
  n = 5; 
  m = 3; 
  int allocation[5][3] = { { 0, 1, 0 }, 
                     { 2, 0, 0 }, 
                     { 3, 0, 2 }, 
                     { 2, 1, 1 }, 
                     { 0, 0, 2 } }; 
  
  int maximum[5][3] = { { 7, 5, 3 }, 
                   { 3, 2, 2 }, 
                   { 9, 0, 2 }, 
                   { 2, 2, 2 }, 
                   { 4, 3, 3 } };
  
  int available[3] = { 3, 3, 2 };
  
  int f[n], ans[n], ind = 0;
  for (k = 0; k < n; k++) {
    f[k] = 0;
  }
  int remaining[n][m];
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++)
      remaining[i][j] = maximum[i][j] - allocation[i][j];
  }
  int y = 0;
  for (k = 0; k < 5; k++) {
    for (i = 0; i < n; i++) {
      if (f[i] == 0) {
  
        int flag = 0;
        for (j = 0; j < m; j++) {
          if (remaining[i][j] > available[j]){
            flag = 1;
            break;
          }
        }
  
        if (flag == 0) {
          ans[ind++] = i;
          for (y = 0; y < m; y++)
            available[y] += allocation[i][y];
          f[i] = 1;
        }
      }
    }
  }
  
  cout << "Following is the SAFE Sequence" << endl;
  for (i = 0; i < n - 1; i++)
    cout << " P" << ans[i] << " ->";
  cout << " P" << ans[n - 1] <<endl;
  
    return (0);
}