Solved 6 problem in filtrationContest and restructured the repo

4 files changed, 89 insertions, 0 deletions

diff --git a/HackerRank/CountingSort1/CountingSort1.cpp b/HackerRank/CountingSort1/CountingSort1.cpp
new file mode 100644
index 0000000..20b476a
--- /dev/null
+++ b/HackerRank/CountingSort1/CountingSort1.cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int n, x;
+  cin >> n;
+  vector<int> v;
+  vector<int> freq(100);
+  for(int i = 0; i < n; i ++){
+    cin >> x;
+    freq[x]+=1;
+  }
+  for(auto m : freq){
+    cout << m << " ";
+  }
+  cout << endl;
+  return 0;
+}
diff --git a/HackerRank/CountingSort2/CountingSort2.cpp b/HackerRank/CountingSort2/CountingSort2.cpp
new file mode 100644
index 0000000..29fb91c
--- /dev/null
+++ b/HackerRank/CountingSort2/CountingSort2.cpp
@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int n, x;
+  cin >> n;
+  vector<int> v;
+  vector<int> freq(100);
+  for(int i = 0; i < n; i ++){
+    cin >> x;
+    freq[x]+=1;
+  }
+  for(int i = 0; i < freq.size(); i++){
+    for(int j = 0; j < freq[i]; j++){
+      cout << i << " ";
+    }
+  }
+  cout << endl;
+  return 0;
+}
diff --git a/HackerRank/LonelyInteger/LonelyInteger.cpp b/HackerRank/LonelyInteger/LonelyInteger.cpp
new file mode 100644
index 0000000..a5ce4a4
--- /dev/null
+++ b/HackerRank/LonelyInteger/LonelyInteger.cpp
@@ -0,0 +1,12 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+  int n, x = 0, k;
+  cin >> n;
+  for(int i = 0; i < n; i++){
+    cin >> k;
+    x ^= k;
+  }
+  cout << x;
+  return 0;
+}
diff --git a/HackerRank/Luck_balance/Luck_balance.cpp b/HackerRank/Luck_balance/Luck_balance.cpp
new file mode 100644
index 0000000..403b53f
--- /dev/null
+++ b/HackerRank/Luck_balance/Luck_balance.cpp
@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool comparePair(pair<int, int> p1, pair<int, int> p2){
+  if(p1.second >= p2.second && p1.first > p2.first){
+    return true;
+  }
+  else {
+  return false;
+  }
+}
+
+int main() {
+  int n, k, sum = 0, cn=0;
+  cin >> n >> k;
+  vector<pair<int, int>> vp(n);
+  for(auto &x : vp){
+    cin >> x.first >> x.second;
+  }
+  sort(vp.begin(), vp.end(), comparePair);
+  cout << "-----------------------------------";
+  cout << endl;
+  for(auto x : vp){
+    cout << x.first << " " << x.second << endl;
+  }
+  for(int i = 0; i < n; i++){
+    if(vp[i].second == 1){
+      cn++;
+    }
+    if(cn != k - 1){
+      cout << "vp[" << i << "]" << vp[i].first << endl;
+      sum+=vp[i].first;
+    }
+  }
+  sum -= vp[cn].first;
+  cout << sum << endl;
+  return 0;
+}