Submission #1535112

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
int N,W;
int main(){
	cin>>N>>W;
	int off = 0;
	vector<int> vs[4];
	rep(i,N){
		int w;
		cin>>w;
		if(i==0) off = w;
		w -= off;
		int v;
		cin>>v;
		vs[w].pb(v);
	}
	rep(i,4) sort(all(vs[i]),greater<int>());
	int ans = 0;

	int vi = 0;
	rep(i,vs[0].size()+1){
		if(i!=0) vi += vs[0][i-1];
		int vj = 0;
		rep(j,vs[1].size()+1){
			if(j!=0) vj += vs[1][j-1];
			int vk = 0;
			rep(k,vs[2].size()+1){
				if(k!=0) vk += vs[2][k-1];
				int vl = 0;
				rep(l,vs[3].size()+1){
					if(l!=0) vl += vs[3][l-1];
					int wei = (off)*i + (off+1)*j + (off+2)*k + (off+3)*l;
					if(wei<=W){
						int val = vi+vj+vk+vl;
						chmax(ans,val);
					}
				}
			}
		}
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result