Submission #1607709

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
ll ma=0,v,c; int n,u,b,w;
vector<ll> a[4],s[4];
 
int main(){
	cin >> n >> u >> c >> b;
	a[0].push_back(b);
	REP(i,1,n){
		cin >> w >> v;
		a[w-c].push_back(v);
	}
	REP(i,0,4) sort(a[i].begin(),a[i].end(),greater<ll>());
	REP(i,0,4) s[i].push_back(0);
	REP(i,0,4) REP(j,1,a[i].size()+1) s[i].push_back(s[i][j-1]+a[i][j-1]);
	REP(i,0,a[0].size()+1) REP(j,0,a[1].size()+1) REP(k,0,a[2].size()+1) REP(l,0,a[3].size()+1)
		if((c*i)+(c+1)*j+(c+2)*k+(c+3)*l<=u) ma=max(ma, s[0][i]+s[1][j]+s[2][k]+s[3][l]);
	
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result