Bon Apetite

What is the problem with my code…
I am getting wrong answer.
public static void Apetite(int[] arr,int[] depar,int[] pref,int k, int n){
Map<Integer,Boolean> occupied = new HashMap<>();
int count=0,keep_in=-1;
for(int i=0;i<n;i++){
if(!occupied.containsKey(pref[i])){
occupied.put(pref[i],false);
}
}
for(int i=0;i<n;i++){
if(!occupied.get(pref[i])){
count++; keep_in++;
occupied.replace(pref[i],true);
}else{
if(arr[i]>=depar[keep_in]){
count++; keep_in++;
}
}
}
System.out.println(count);
}
public static void main(String[] args) throws java.lang.Exception {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt(); int k=sc.nextInt();
int[] arr = new int[n]; int[] depar = new int[n];
int[] pref = new int[n];
for(int i=0;i<n;i++){
arr[i]=sc.nextInt(); depar[i]=sc.nextInt();
pref[i]=sc.nextInt();
}
Apetite(arr,depar,pref,k,n);
}