一道水题调了一个小时。学个啥oi还是回家种田吧qwq
####题解
开三个队列,将原序列由大到小排列好之后放进第一个队列,然后每次取出三个队列中队头进行比较再切掉分别放到第二个第三个队列尾部。
####代码
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<cstring>
#define inf 0x3f3f3f3f
using namespace std;
queue<int> q1,q2,q3;
int a[8010000],n,m,u,v,t,q,add;
bool cmp(int x,int y){return x>y;}
inline int read() {
int ret=0;char ch=getchar();
for (;!isdigit(ch);ch=getchar());
for (;isdigit(ch);ch=getchar()) ret=ret*10+ch-'0';
return ret;
}
int compare()
{
int k1=q1.size()?q1.front()+add:-inf,
k2=q2.size()?q2.front()+add:-inf,
k3=q3.size()?q3.front()+add:-inf,
ret=max(k3,max(k1,k2));
if (ret==k1) q1.pop();
else if (ret==k2) q2.pop();
else q3.pop();
return ret;
}
int main()
{
n=read();m=read();q=read();u=read();v=read();t=read();
for (int i=1;i<=n;i++) a[i]=read();
sort(a+1,a+1+n,cmp);
for (int i=1;i<=n;i++) q1.push(a[i]);
for (int i=1;i<=m;i++,add+=q)
{
int mx=compare(),l1=(long long)mx*u/v,l2=mx-l1;
if (i%t==0){i==t?printf("%d",mx):printf(" %d",mx);};
q2.push(l1-add-q),q3.push(l2-add-q);
}
printf("\n");
for (int i=1;i<=n+m;i++)
if (i%t==0) i==t?printf("%d",compare()):printf(" %d",compare());
else compare();
return 0;
}