#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,T;cin>>N>>T; vl R(N),A(N),B(N);cin>>R; rep(i,0,N)cin>>A[i]>>B[i]; vectorX,Y; rep(i,0,N){ if(A[i]<=B[i])X.emplace_back(-B[i],i); else Y.emplace_back(A[i],i); } sort(all(X)); sort(all(Y)); vl I; for(auto[_,i]:Y)I.emplace_back(i); for(auto[_,i]:X)I.emplace_back(i); vl AA(N+1),BB(N+1); rep(i,0,N)AA[i+1]=AA[i]+R[I[i]]*A[I[i]]; rep(i,0,N)BB[i+1]=BB[i]+R[I[i]]*B[I[i]]; ll ans=0; rep(i,0,N)chmax(ans,AA[i]+A[i]+BB[N]-BB[i]); ans+=T*(N-1); cout<