#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,k; cin>>n>>k;
pair<int,int> a[n]; // (d,w)
for(int i=0;i<n;++i)
cin>>a[i].second>>a[i].first;
// Subtask 2
sort(a,a+n);
pair<int,int> ans={0,0};
priority_queue<int> pq;
for(int t=n,i=n-1;t>=1;--t){
while(i>=0&&a[i].first>=t)
pq.emplace(-a[i--].second);
if(pq.size()){
//cout<<pq.top()<<'\n';
++ans.first;
ans.second-=pq.top();
pq.pop();
}
}
cout<<ans.first<<" "<<ans.second<<'\n';
/* Subtask 1
sort(a,a+n);
int t=0;
for(int i=0;i<n;++i){
if(a[i].second>t) ++t;
}
cout<<t<<" "<<t*a[0].first<<'\n';
return 0;
*/
}
# | 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... |