Job_Sequencing.cpp

#include<bits/stdc++.h>


using namespace std;

struct Job{
    int id;
    int dead;
    int profit;
};


class Solution
{
    public:

    bool compare(Job a, Job b){
        return a.profit > b.profit;
    }
    vector<int> JobScheduling(Job arr[],int n){
        sort(arr,arr+n,compare);
        bool done[n]={0};

        int day=0;
        int profit=0;

        for(int i=0;i<n;i++){
            for(int j=min(n,arr[i].dead-1);j>=0;j--){
                if(done[j]==false){
                    day+=1;
                    profit+=(arr[i].profit);
                    done[j]=true;
                    break;
                }
            }
        }
            return {day,profit};    
    }
};

int main(){



    return 0;
}