# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536803 | xp875 | Let's Win the Election (JOI22_ho_t3) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll u = 10000;
int main() {
int n, k;
cin >> n >> k;
ll a[n], b[n];
pair<ll, ll> p[n];
for(int i=0; i<n; i++) {
cin >> a[i] >> b[i];
p[i] = make_pair(b[i]==-1, a[i]);
}
sort(p, p+n);
//for(int i=0; i<n; i++ ) cout << p[i].first << ' ' << p[i].second << '\n';
ll tot = 0, helper=1;
for(int i=0; i<k; i++) {
tot += p[i].second
}
cout << tot;
}