题目:
https://www.acwing.com/problem/content/147/
思路:
见https://www.acwing.com/video/76/
代码:
//贪心策略没想到。。。
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int N=10010;
typedef pair<int,int> PII;
priority_queue <PII,vector<PII>,greater<PII> > q;
PII A[N];
bool cmp(PII a,PII b)
{
return a.second<b.second;
}
int main()
{
int n;
while(cin>>n)
{
int res=0;
for(int i=1;i<=n;i++)
{
int p,d;
cin>>p>>d;
A[i]={p,d};
}
sort(A+1,A+n+1,cmp);
for(int i=1;i<=n;i++)
{
q.push(A[i]);
if(q.size()>A[i].second)
q.pop();
}
while(!q.empty())
{
res+=q.top().first;
q.pop();
}
cout<<res<<endl;
}
}