C++14(g++5.4) 解法, 执行用时: 447ms, 内存消耗: 12396K, 提交时间: 2020-01-14 18:39:44

#include<bits/stdc++.h>
using namespace std;
struct node{
	int d,s;
}a[1000005];
int cmp(node x,node y){
	return x.d<y.d;
}
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d%d",&a[i].d,&a[i].s);
	sort(a,a+n,cmp);
	priority_queue<int,vector<int>,greater<int> >q;
	for(int i=0;i<n;i++){
		q.push(a[i].s);
		while(q.size()>a[i].d)
			q.pop();
	}
	int sum=0;
	while(!q.empty()){
		sum+=q.top();
		q.pop();
	}
	cout<<sum<<"\n";
	return 0;
}

C++ 解法, 执行用时: 492ms, 内存消耗: 12584K, 提交时间: 2021-11-27 09:59:14

#include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
	int x,y;
}a[1000001];
bool comp(node x1,node x2)
{
	return x1.x>x2.x;
}
priority_queue<int>q;
int main()
{cin>>n;
for(int i=1;i<=n;i++)
{
	cin>>a[i].x>>a[i].y;
}
sort(a+1,a+1+n,comp);
int sum=0;
int i;
int j=1;
q.push(a[1].y);
for(i=a[1].x;i>=1;i--)
{
	while(i==a[j+1].x)
	{
		j++;
		q.push(a[j].y);
	}
	if(!q.empty())
	{
		sum+=q.top();
		q.pop();
	}
}
cout<<sum;
return 0;
	
}