|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
In operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needs to be replaced when new page comes in. Whenever a new page is referred and is not present in memory, page fault occurs and Operating System replaces one of the existing pages with newly needed page.
Given a sequence of pages and memory capacity, your task is to find the number of page faluts using Least Recently Used (LRU) Algorithm .
The first line of input contains an integer T denoting the number of test cases. Each test case contains number of pages n and next line contains space seaprated sequence of pages. The following line consist of the capacity of the memory.
Note: Pages are referred in the order left to right from the array (i.e index 0 page is referred first then index 1 and so on). Memory is empty at the start .
Output the number of page faults.
5 0 1 3 2 4 1 0 5
3 1 0 2 5 4 1 2