BZOJ2802: [Poi2012]Warehouse Store

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 250000+5
26 
27 #define maxm 500+100
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define mod 1000000007
44 
45 using namespace std;
46 
47 inline int read()
48 
49 {
50 
51     int x=0,f=1;char ch=getchar();
52 
53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
54 
55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
56 
57     return x*f;
58 
59 }
60 int n,a[maxn],b[maxn];
61 bool v[maxn];
62 priority_queue<pa,vector<pa> >q;
63 
64 int main()
65 
66 {
67 
68     freopen("input.txt","r",stdin);
69 
70     freopen("output.txt","w",stdout);
71 
72     n=read();
73     for1(i,n)a[i]=read();
74     for1(i,n)b[i]=read();
75     ll now=0;
76     for1(i,n)
77     {
78         now+=a[i];
79         if(now>=b[i])q.push(pa(b[i],i)),now-=b[i],v[i]=1;
80         else if(!q.empty())
81         {
82             int x=q.top().first,y=q.top().second;
83             if(x>b[i])q.pop(),q.push(pa(b[i],i)),now+=x-b[i],v[i]=1,v[y]=0;
84         }
85     }
86     int ans=0;
87     for1(i,n)if(v[i])ans++;
88     printf("%d\n",ans);
89     bool flag=1;
90     for1(i,n)if(v[i]){if(flag)printf("%d",i),flag=0;else printf(" %d",i);}
91 
92     return 0;
93 
94 }