package GreedyAlgo;

import java.util.ArrayList;

public class ActivitySelection {
    public static void main(String[] args) {
        int arr [] ={1,2,3,4};
        int arr2[] = {4,3,5,5};
        System.out.println(maxact(arr,arr2));
    }
    static int maxact(int start[],int [] end){
        int activites[][] = new int[start.length][3];
        for(int i=0;i< start.length;i++){
            activites[i][0]=i;
            activites[i][1]=start[i];
            activites[i][1]=end[i];
        }
        ArrayList<Integer> s =new ArrayList<>();
        int maxact = 1;
        s.add(0);
        int lastend = end[0];
        for(int i=1;i<start.length;i++){
            if(start[i]>=lastend){
                maxact++;
                s.add(i);
                lastend=end[i];
            }
        }
        for (int a: s) {
            System.out.print("A"+a +" ");
        }
        System.out.println();
        return maxact;
    }
}