求连续和的时候,可以用堆来写,复杂度为nlogn;
代码如下
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
struct Node
{
int l,r,s,m;
}ans[100007];
bool cmp(Node a,Node b)
{
return a.s<b.s;
}
int main()
{
int N,C,F;
scanf("%d%d%d",&N,&C,&F);
for(int i=1;i<=C;i++){
scanf("%d%d",&ans[i].s,&ans[i].m);
}
sort(ans+1,ans+C+1,cmp);
priority_queue<int> q;
int sum=0;
for(int i=1;i<=N/2;i++){
sum+=ans[i].m;
q.push(ans[i].m);
}
ans[N/2].l=sum;
for(int i=N/2+1;i<C-N/2;i++){
q.push(ans[i].m);
int temp=q.top();
q.pop();
sum+=(ans[i].m-temp);
ans[i].l=sum;
}
sum=0;
while(!q.empty()){
q.pop();
}
for(int i=C-N/2+1;i<=C;i++){
sum+=ans[i].m;
q.push(ans[i].m);
}
ans[C-N/2+1].r=sum;
for(int i=C-N/2;i>N/2+1;i--){
q.push(ans[i].m);
int temp=q.top();
q.pop();
sum+=(ans[i].m-temp);
ans[i].r=sum;
}
int tt=-1;
for(int i=C-N/2;i>N/2;i--){
if(ans[i].m+ans[i+1].r+ans[i-1].l<=F) {
tt=ans[i].s; break;
}
}
printf("%d\n",tt);
}