这个e题要这么写呀，不然怎么写啊

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1000005],b[1000005];
int ans[1000005];
struct cmp
{
bool operator()(int x,int y)
{
return b[x] < b[y];
}
};
priority_queue<int,vector,cmp> q;
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
for(int i=1;i<=n;i++) scanf("%lld",&b[i]);

ll sum=0;
for(int i=1;i<=n;i++)
{
    sum+=a[i];
    if(b[i] <= sum)
    {
        sum-=b[i];
        q.push(i);
    }
    else 
    {
        if(q.size() && b[q.top()] > b[i])
        {
            sum = sum + b[q.top()] - b[i];
            q.pop();
            q.push(i);
        }
    }
}

printf("%d\n",q.size());
int l=0;
while(q.size())
{
    l++;
    ans[l]=q.top();
    q.pop();
}
for(int i=l;i>=1;i--) printf("%d ",ans[i]);

}