Easiest c implementation pure optimal page replacement algorithm

// Code_Chef_Cleaning_Tables.cpp : This file contains the 'main' function. Program execution begins and ends there.

//

#include<stdio.h>

bool check(int arr[], int a, int k)

{

for (int i = 0; i < k; i++)

{

im getting WA on most of the cases. can anyone help whats the problem i did here ?

#include <stdio.h>

int a[200005], d[200005];

void merge(int l, int m, int h)

{

int i,j,k;

int c[200005];

int b[200005];

i=l;k=l;