aboutsummaryrefslogtreecommitdiff
path: root/Luck_balance.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 /Luck_balance.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 'Luck_balance.cpp')
-rw-r--r--Luck_balance.cpp37
1 files changed, 0 insertions, 37 deletions
diff --git a/Luck_balance.cpp b/Luck_balance.cpp
deleted file mode 100644
index 403b53f..0000000
--- a/Luck_balance.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-#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;
-}