minimum cost path by recursion

#include<iostream>
#include<math.h>
using namespace std;
int MinCost(int C[3][3],int r,int c){
    if(r==0 && c==0)
        return C[0][0];
    if(r<0 || c<0)
        return INT_MAX;
   return C[r][c]+min(MinCost(C,r-1,c),min(MinCost(C,r-1,c-1),MinCost(C,r,c-1)));
  }

int main(){
int r=3,c=3;
int C[r][3]={ {1,2,3},
              {4,8,2},
              {1,5,3}
               };
cout<<MinCost(C,2,2);
  return 0;
  }