blob: 403b53f1269c613b8420e5e06ff02f3b99c49c70 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
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;
}
|