https://www.51nod.com/Challenge/Problem.html#!#problemId=1163
区间贪心
纯暴力解法
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=50000+100;
struct node
{
int end;
ll cost;
} a[maxn];
bool cmp(node x,node y)
{
if(x.cost>y.cost) return true;
return false;
}
int book[maxn];
int main()
{
int n,i,j,k;
ll ans;
ans=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i].end>>a[i].cost;
sort(a,a+n,cmp);
for(i=0;i<n;i++) {
k=a[i].end;
while(k) {
if(book[k]==0) {
book[k]=1;
ans+=a[i].cost;
break;
}
k--;
}
}
cout<<ans<<endl;
return 0;
}
结果会爆int记得把结果开成long long
贪心+优先队列
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn=50000+10;
pair<int,int>a[maxn];//a[i].first 最晚结束时间E[i]; a[i].second 奖励W[i]
int main() {
int n;
while(cin>>n) {
for(int i=0;i<n;i++){
cin>>a[i].first>>a[i].second;
}
sort(a,a+n);//按照权值排序;
priority_queue<int>q; //大根堆 从小到大排序
//每次需要加入相反数,top出绝对值小的
long long ans=0;
for(int i=0;i<n;i++){
q.push(-a[i].second);
ans+=a[i].second;
if(q.size()>a[i].first){
int x=q.top();//负的,最小的,多余的舍弃
ans+=x;
q.pop();
}
}
cout<<ans<<endl;
}
return 0;
}