Submission #642320

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

vint a[101010];
int N,X;
int T[101010],A[101010];

bool C(int t){
    priority_queue<int>que;
    for(int i=101010-1;i>t;i--)rep(j,a[i].size())que.push(a[i][j]);
    int sum=0;
    for(int i=t;i>=0;i--){
        rep(j,a[i].size())que.push(a[i][j]);
        if(que.empty())continue;
        sum+=que.top();
        que.pop();
    }
    return sum>=X;
}

signed main(){
    cin>>N>>X;
    rep(i,N)cin>>T[i],T[i]--;
    rep(i,N)cin>>A[i];

    rep(i,N)a[T[i]].pb(A[i]);

    int lb=-1,ub=101010;
    while(ub-lb>1){
        int mid=(ub+lb)/2;
        if(C(mid))ub=mid;
        else lb=mid;
    }
    if(ub==101010)cout<<-1<<endl;
    else cout<<ub+1<<endl;
    return 0;
}

Submission Info

Judge Result