From 6f18a02690434a8d5175f6c0631c7c1e5d5e4b9c Mon Sep 17 00:00:00 2001
From: ashish007kumar <ashishkumar357ak@gmail.com>
Date: Thu, 27 Feb 2020 22:10:25 +0530
Subject: [PATCH] greedy

---
 Greedy Algorithm/New Text Document.txt | 72 ++++++++++++++++++++++++++
 1 file changed, 72 insertions(+)
 create mode 100644 Greedy Algorithm/New Text Document.txt

diff --git a/Greedy Algorithm/New Text Document.txt b/Greedy Algorithm/New Text Document.txt
new file mode 100644
index 0000000..3a246bf
--- /dev/null
+++ b/Greedy Algorithm/New Text Document.txt	
@@ -0,0 +1,72 @@
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+int making(int pages[],int n,int capacity)
+{
+    unordered_set<int>s;
+    unordered_map<int,int>map1;
+    int pagefault=0;
+    
+    for(int i=0;i<n;i++)
+    {
+        if(s.size()<capacity)
+        {
+            if(s.find(pages[i])==s.end())
+            {
+                s.insert(pages[i]);
+                pagefault++;
+            }
+            map1[pages[i]]=i;
+        }
+        
+        else 
+        {
+            if(s.find(pages[i])==s.end())
+            {
+                int x=INT_MAX;
+                int val;
+                
+                for(auto it=s.begin();it!=s.end();it++)
+                {
+                    if(map1[*it]<x)
+                    {
+                        x=map1[*it];
+                        val=*it;
+                    }
+                }
+                   s.erase(val);
+                   s.insert(pages[i]);
+                   pagefault++;
+                
+            }  
+            map1[pages[i]]=i;
+        }
+    }
+  return pagefault;  
+}
+
+
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    int A[n];
+	    for(int i=0;i<n;i++)
+	    {
+	        cin>>A[i];
+	    }
+	    int jj;
+	    cin>>jj;
+	 cout<<   making(A,n,jj);
+	 cout<<endl;
+	}
+	
+	
+	return 0;
+}
\ No newline at end of file