From 2587a314e291f5eb4cbd1b5214662ad4a7f6ce5f Mon Sep 17 00:00:00 2001
From: sinjini05 <98803426+sinjini05@users.noreply.github.com>
Date: Mon, 13 Feb 2023 23:48:35 +0530
Subject: [PATCH] Added solution - LeetHub

---
 Ceil The Floor - GFG/ceil-the-floor.cpp | 61 +++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 Ceil The Floor - GFG/ceil-the-floor.cpp

diff --git a/Ceil The Floor - GFG/ceil-the-floor.cpp b/Ceil The Floor - GFG/ceil-the-floor.cpp
new file mode 100644
index 0000000..6b6e591
--- /dev/null
+++ b/Ceil The Floor - GFG/ceil-the-floor.cpp	
@@ -0,0 +1,61 @@
+//{ Driver Code Starts
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+pair<int, int> getFloorAndCeil(int arr[], int n, int x);
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, x;
+        cin >> n >> x;
+        int arr[n];
+        for (int i = 0; i < n; i++) {
+            cin >> arr[i];
+        }
+        auto ans = getFloorAndCeil(arr, n, x);
+        cout << ans.first << " " << ans.second << "\n";
+    }
+    return 0;
+}
+
+// } Driver Code Ends
+
+pair<int, int> getFloorAndCeil(int arr[], int n, int x) {
+
+    int c=-1,f=-1;
+
+    int c1=0;
+
+    for(int i=0;i<n;i++){
+
+        if(arr[i]<x) f=max(f,arr[i]);
+
+        if(arr[i]>x) 
+
+        { if(c1==0){ c=arr[i]; c1++;}
+
+          else c=min(c,arr[i]);
+
+        }
+
+        if(arr[i]==x){
+
+            c=arr[i];
+
+            f=arr[i];
+
+            break;
+
+        }
+
+    }
+
+    pair<int,int>p(f,c);
+
+    return p;
+
+}
\ No newline at end of file