Help me in solving MAXCOMP problem

My issue

plz give approach to start this que.

My code

#include <bits/stdc++.h>
#define r(i,a,b) for(int i=a,i<b;i++)
using namespace std;
int dp[49][49][1000001];
int funmax(int n,vector<int>s,vector<int>e,vector<int>c,int j){
    
}
int main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--){
	    int n;
	    cin>>n;
	    vector<int>s(n),e(n),c(n);
	    r(i,0,n){
	        cin>>s[i];
	    }
	       r(i,0,n){
	        cin>>e[i];
	    }
	       r(i,0,n){
	        cin>>c[i];
	    }
	    memset(dp,-1,sizeof(dp));
	    cout<<funmax(n,s,e,c,0)<<endl;
	}
	return 0;
}

Problem Link: MAXCOMP Problem - CodeChef