Rod cutting RECURSIVE

#include<iostream>
#include<limits>
#include<algorithm>

using namespace std;

int cut_rod(int* len,int n)
{
    if(n==0)
     return 0;
    int temp= INT_MIN;
    for(int i=1 ; i<=n ; i++)
     temp= max(temp, len[i]+ cut_rod(len,n-i));
    return temp;
}
int main()
{
    int n,i;
    cout<<"\nEnter length of rod: ";
    cin>>n;
    int* len= new int[n+1];
    cout<<"\nEnter prices of rod sub-lengths: (from 1-n): ";
    for(i=1 ; i<=n ; i++)
     cin>>len[i];
    cout<<"\nMax price the rod can be sold at is:  "<<cut_rod(len,n);
}