Subset some problem by dp

#include<iostream>
using namespace std;

int IsSubsetSum(int arr[],int n,int sum){
  int subset[n+1][sum+1];
  for(int i=0;i<=n;i++)
    subset[i][0]=1;
  for(int i=0;i<=sum;i++)
    subset[0][i]=0;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=sum;j++){
      if(arr[i-1]>j)
             subset[i][j]=subset[i-1][j];
      else
        subset[i][j]=subset[i-1][j]||subset[i-1][j-arr[i-1]];
      }
    }
    return subset[n][sum];
  }

int main(){
    int arr[] = { 3, 34, 4, 12, 5, 2 };
    int sum = 38;
    int n = 6;
    if (IsSubsetSum(arr,n,sum))
        cout<<("Found a subset with given sum");
    else
        cout<<("No subset with given sum");
    return 0;
    }