N任务

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
struct node{
int time;
int wei;
friend bool operator <(node a,node b){
a.wei>b.wei;
}
}a[1005];
int n;

int com(struct node a,struct node b){
return a.time<b.time;
}

int bfs(){
priority_queue<node> q;
struct node p,t;
int time=0;
for(int i=0;i<n;i++){
//	cout<<time<<' '<<a[i].time<<' '<<a[i].wei<<endl;
if(time<a[i].time){
p.time=a[i].time;
p.wei=a[i].wei;
time+=1;
q.push(p);
}
else if(time>=a[i].time){
t=q.top();
cout<<t.wei<<' '<<t.time<<' '<<a[i].wei<<endl;
if(t.wei<a[i].wei){
q.pop();
p.time=a[i].time;
p.wei=a[i].wei;
q.push(p);
}
}
}
int ans=0;
while(!q.empty()){
t=q.top();
q.pop();
cout<<t.time<<' '<<t.wei<<endl;
ans+=t.wei;
}
return ans;
}

int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&a[i].time,&a[i].wei);
}
sort(a,a+n,com);
printf("%d\n",bfs());
return 0;
}