diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-04-30 01:13:40 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-04-30 01:13:40 +0200 |
| commit | a0d7b8320a8996eee0ed957b79c3a882f8b47146 (patch) | |
| tree | 76242ae2b19bad00796ed6d0104da8a0e4a99abe /Luck_balance.cpp | |
| download | competitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.tar.xz competitive-programming-a0d7b8320a8996eee0ed957b79c3a882f8b47146.zip | |
Added all current problems
Diffstat (limited to 'Luck_balance.cpp')
| -rw-r--r-- | Luck_balance.cpp | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/Luck_balance.cpp b/Luck_balance.cpp new file mode 100644 index 0000000..403b53f --- /dev/null +++ b/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; +} |
