diff --git a/Task1/img/sniggy10.jpg b/Task1/img/sniggy10.jpg
new file mode 100644
index 00000000..eb28e871
Binary files /dev/null and b/Task1/img/sniggy10.jpg differ
diff --git a/Task1/index.html b/Task1/index.html
index 02288f78..5f9d8605 100644
--- a/Task1/index.html
+++ b/Task1/index.html
@@ -1293,7 +1293,18 @@ <h5 class="card-title text-center">galacticGhoul</h5>
                 </div>
         </div>
 </div>
-  
+
+
+    <div class="col-md-2 col-sm-6 my-12 mx-auto p-relative bg-white shadow-1 blue-hover mycard mycard" style="width: 360px; overflow: hidden; border-radius: 1px;">
+        <img src="./img/sniggy10.jpg" class="pic w-full">
+            <div class="card-body">
+                    <h5 class="card-title text-center">Snigdha Ansu</h5>
+                    <div class="text-center">
+                        <a href="https://github.com/sniggy10"><i class="fa fa-github-square icon fa-3x"></i></a>
+                        <a href="https://www.linkedin.com/in/snigdha-ansu-413079173/"><i class="fa fa-linkedin-square fa-3x"></i></a>
+                    </div>
+            </div>
+    </div>
  <!-- Paste Above this line -->
 </div> <!-- end row -->
 
diff --git a/Task3/cpp/K_largest_elements.cpp b/Task3/cpp/K_largest_elements.cpp
new file mode 100644
index 00000000..0e663437
--- /dev/null
+++ b/Task3/cpp/K_largest_elements.cpp
@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+class Solution{
+
+public:
+    void swap(int* a,int* b)
+    {
+        int temp = *a;
+        *a=*b;
+        *b=temp;
+    }
+
+public:
+    void max_heapify(int a[],int n,int i){
+        int largest=i;
+        int l=2*i+1;
+        int r=2*i+2;
+
+        if(l<n&&a[l]>a[largest])
+        largest=l;
+
+        if(r<n&&a[r]>a[largest])
+        largest=r;
+
+        if(i!=largest){
+            swap(&a[i],&a[largest]);
+            max_heapify(a,n,largest);
+        }
+    }
+public:
+	vector<int> kLargest(int arr[], int n, int k) {
+
+	   for(int i=n/2-1;i>=0;i--)
+	        max_heapify(arr,n,i);
+
+	   vector<int>kl;
+
+	   for(int i=n-1;i>=n-k;i--)
+	   {
+	       kl.push_back(arr[0]);
+	       swap(&arr[0],&arr[i]);
+	       max_heapify(arr,i,0);
+	   }
+	  return kl;
+	}
+
+};
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, k;
+        cin >> n >> k;
+        int arr[n];
+        for (int i = 0; i < n; i++) {
+            cin >> arr[i];
+        }
+        Solution ob;
+        auto ans = ob.kLargest(arr, n, k);
+        for (auto x : ans) {
+            cout << x << " ";
+        }
+        cout << "\n";
+    }
+    return 0;
+}