Alisha’s Party
Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2650 Accepted Submission(s): 722
and all of them will come at a different time. Because the lobby is not
large enough, Alisha can only let a few people in at a time. She
decides to let the person whose gift has the highest value enter first.
Each time when Alisha opens the door, she can decide to let p people enter her castle. If there are less than p
people in the lobby, then all of them would enter. And after all of her
friends has arrived, Alisha will open the door again and this time
every friend who has not entered yet would enter.
If there are two friends who bring gifts of the same value, then the one who comes first should enter first. Given a query n Please tell Alisha who the n−th person to enter her castle is.
In each test case, the first line contains three numbers k,m and q separated by blanks. k is the number of her friends invited where 1≤k≤150,000. The door would open m times before all Alisha’s friends arrive where 0≤m≤k. Alisha will have q queries where 1≤q≤100.
The i−th of the following k lines gives a string Bi, which consists of no more than 200 English characters, and an integer vi, 1≤vi≤108, separated by a blank. Bi is the name of the i−th person coming to Alisha’s party and Bi brings a gift of value vi.
Each of the following m lines contains two integers t(1≤t≤k) and p(0≤p≤k) separated by a blank. The door will open right after the t−th person arrives, and Alisha will let p friends enter her castle.
The last line of each test case will contain q numbers n1,...,nq separated by a space, which means Alisha wants to know who are the n1−th,...,nq−th friends to enter her castle.
Note: there will be at most two test cases containing n>10000.
5 2 3
Sorey 3
Rose 3
Maltran 3
Lailah 5
Mikleo 6
1 1
4 2
1 2 3
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<queue>
#include<vector>
#include<cstdlib>
#include<string>
#include<map>
#include<stack> using namespace std;
#define ll long long
#define lson le,mid,num<<1
#define rson mid+1,ri,num<<1|1
#define stop1 puts("QAQ")
#define stop2 system("pause")
#define maxn 160000 struct node
{
char s[];
int val;
int id;
bool operator < (const node & a) const
{
if(val!=a.val)
return val < a.val;
return id>a.id;
} }peo[maxn];
struct kk
{
int x,y;
}tt[maxn]; int cmp(kk a, kk b)
{
return a.x < b.x;
}
char ans[maxn][]; int main()
{ int T;
scanf("%d",&T);
while(T--)
{ int k,m,q;
scanf("%d%d%d",&k,&m,&q);
for(int i=;i<=k;i++)
{
scanf("%s%d",peo[i].s,&peo[i].val);
peo[i].id=i;
} for(int i=;i<=m;++i)
scanf("%d%d",&tt[i].x,&tt[i].y); sort(tt+, tt+m+,cmp);
priority_queue<node> Q;
memset(ans, , sizeof ans); int sum=,pos=;
for(int i=;i<=m;i++)
{ for(int j = pos; j <=tt[i].x; j++)
{
Q.push(peo[j]);
pos++;
}
for(int j=;j<=tt[i].y;j++)
{
if(!Q.empty())
{node temp = Q.top();
Q.pop();
sum++;
strcpy(ans[sum],temp.s);
}
else
break;
}
} for(int i=pos;i<=k;i++)
{
Q.push(peo[i]);
}
while(!Q.empty())
{
node temp = Q.top();
Q.pop();
sum++;
strcpy(ans[sum],temp.s);
} int ss;
for(int i=;i<q;i++)
{
scanf("%d",&ss);
printf("%s ",ans[ss]);
}
if(q!=)
{
scanf("%d",&ss);
printf("%s\n",ans[ss]);
} }
return ;
}