From c52b36c6a37fdb1d1de146d3939cb42e2c691f44 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Sat, 5 Nov 2022 01:28:02 +0200
Subject: Solved 6 problem in filtrationContest and restructured the repo

---
 HackerRank/Luck_balance/Luck_balance.cpp | 37 ++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 HackerRank/Luck_balance/Luck_balance.cpp

(limited to 'HackerRank/Luck_balance')

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;
+}
-- 
cgit v1.2.3