#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,k;
cin >> n >> k;
pair<ll,ll> item[n+5];
for (int i=0;i<n;i++){
ll w,d;
cin >> w >> d;
item[i] = {w,d};
}
if (k==1){
ll mx = 0;
ll count=0;
priority_queue<ll> pq;
for (int i=n;i>0;i--){
for (int j=0;j<n;j++){
if (item[j].second == i) pq.push(item[j].first);
}
if (!pq.empty()){
count++;
mx += pq.top();
pq.pop();
}
}
cout << count << ' ' << mx;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |