aboutsummaryrefslogtreecommitdiff
path: root/MinDiffInArray.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /MinDiffInArray.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'MinDiffInArray.cpp')
-rw-r--r--MinDiffInArray.cpp19
1 files changed, 0 insertions, 19 deletions
diff --git a/MinDiffInArray.cpp b/MinDiffInArray.cpp
deleted file mode 100644
index 5440d03..0000000
--- a/MinDiffInArray.cpp
+++ /dev/null
@@ -1,19 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-int main(){
- int n;
- cin >> n;
- vector<int> v(n);
- vector<int> res;
- for(auto &x : v){
- cin >> x;
- }
- sort(v.begin(), v.end());
- for(int i = 0; i < n - 1; i++){
- // 1 2 3 4 5 6 7
- res.push_back(abs(v[i] - v[i+1]));
- }
- cout << *min_element(res.begin(), res.end()) << endl;
- return 0;
-}
-