9,10点迷之wa

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cstdio>
const int maxn=999999;
#define K (k+(i-1)*q)
using namespace std;
int n,m,q,u,v,t,p;
int k,k1,k2;
int num;
priority_queue<int> a;
int main()
{
    cin>>n>>m>>q>>u>>v>>t;
    for(int i=1;i<=n;i++)
    {
        cin>>k;
        a.push(k);
    }
    for(int i=1;i<=m;i++)
    {
        k=a.top();
        if(i%t==0) cout<<K<<" ";
        k1=u*K/v,k2=K-k1;
        k1-=q*i,k2-=q*i;
        a.pop(),a.push(k1),a.push(k2);
    }
    cout<<endl;
    k=(n+m)/t;
    while(k>0)
    {
        num++;
        if(num%t==0)
        {
            cout<<a.top()+m*q<<" ";
            k--;
        }
        a.pop();
    }
    return 0;
}