ChangefreeCodeForces767E

#include 
#include 
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N = 4e5+10, INF = 0x3f3f3f3f;
int n, m;
int c[N], w[N];
int vis[N];    

int main() {
    cin>>n>>m;
    REP(i,1,n) cin>>c[i];
    REP(i,1,n) cin>>w[i];
    priority_queue,greater > q;
    ll ans = 0;
    REP(i,1,n) if (c[i]%100) {
        q.push(pii((100-c[i]%100)*w[i],i));
        if (m100) {
            vis[q.top().y] = 1;
            m += 100;
            ans += q.top().x;
            q.pop();
        }
        m-=c[i]%100;
    }
    cout1,n) {
        if (vis[i]) cout<100+1<<‘ ‘<<0<<‘\n‘;
        else cout<100<<‘ ‘<100<<‘\n‘;
    }
}