please help to convert in C language //find index of nearest job which is//non intersecting to curent job.11 id = findi(v1, n);//find profit by including current//index profit.11 pl = vi[n].pr + solve(v1, id);//find profit by not including//current index element.11 p2 = solve(v1, n - 1);//return maximum value.return max(pl, p2);int main()11 t, st, en, pr;cout « "Enter number of test cases: ";cin t;while (t--) {cout « "Enter number of jobs: ";11 n;cin n;vector v1;cout « "Enter job details: ";for (11 i = 0; i st en pr;v1.push_back({ st, en, pr });//sort according to finish time.sort(v1.begin(), v1.end(), fun);cout « "Maximum profit: ";cout « solve(v1, n - 1) « " ";return e; #include using namespace std;typedef long 1ong 11;//user defined job data type.struct job { //start,end and profit.11 st, en, pr;};//fun function for checking// smallest of two job on basis//of their finish time.bool fun(const jobs j1, const jobk j2){if (j1.en & v1, 11 n)//start variable for binary search.11 st - 0;//end variable for binary search.11 en = n;//search under range of binary//search boundary.while (st c en) {//find mid index.11 mid = st + (en - st) / 2;//if mid index element has finish time less//than equal to start time of nth index element.if (vi[mid].en

Question

please help to convert in C language //find index of nearest job which is//non intersecting to curent job.11 id = findi(v1, n);//find profit by including current//index profit.11 pl = vi[n].pr + solve(v1, id);//find profit by not including//current index element.11 p2 = solve(v1, n - 1);//return maximum value.return max(pl, p2);int main()11 t, st, en, pr;cout « "Enter number of test cases: ";cin >> t;while (t--) {cout « "Enter number of jobs: ";11 n;cin >> n;vector v1;cout « "Enter job details: ";for (11 i = 0; i< n; i++) {cin >> st > en >> pr;v1.push_back({ st, en, pr });//sort according to finish time.sort(v1.begin(), v1.end(), fun);cout « "Maximum profit: ";cout « solve(v1, n - 1) « " ";return e; #include using namespace std;typedef long 1ong 11;//user defined job data type.struct job { //start,end and profit.11 st, en, pr;};//fun function for checking// smallest of two job on basis//of their finish time.bool fun(const jobs j1, const jobk j2){if (j1.en < j2.en)return true;elsereturn false;//findi function using binary search//it reduces the time complexity11 find1(vectorcjob>& v1, 11 n)//start variable for binary search.11 st - 0;//end variable for binary search.11 en = n;//search under range of binary//search boundary.while (st c en) {//find mid index.11 mid = st + (en - st) / 2;//if mid index element has finish time less//than equal to start time of nth index element.if (vi[mid].en <= vi[n].st) {if (vi[mid].en <= vi[n].st) {//check for nrearest index to current//nth element.if (vi[mid + 1].en <= vi[n].st)st = mid + 1;elsereturn mid;}else //reduce search spaces.en = mid - 1;//if no other non intersecting job is found.return -1;//find function working in linear time.11 find(vector& v1, 1l n){//iterate through all elements//and check which job is non intersecting.for (11 i = n - 1; i >= 0; i--) {if (vi[i].en <= vi[n].st)return i;//if not found then return -1.return -1;//solve function which will return maximum//profit.11 solve(vectorcjob>& v1, 11 n)//if one job is remaining.if (n == 0)return vi[n].pr;//if index if out of bound.if (n < 0)return e;

Accepted Answer

C and C ++:
cout is used in c++.In c instead of cout printf is used.
cin is used in c++ to get user…