#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using std::cout; using ll = long long; using ull = unsigned long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define retval(x) {cout << #x << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outmv fore(yans , ans) cout << yans.val() << "\n"; #define assertmle(x) if (!(x)) {vi v(3e8);} #define asserttle(x) if (!(x)) {while(1){}} #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<>n>>m; vl c(n),d(n); rep(i,n) cin>>c[i]>>d[i]; const int mx = 15; ll sum = 0; { vl _c,_d; rep(i,n){ if (c[i]==0){ sum += d[i]; }else{ _c.pb(c[i]); _d.pb(d[i]); } } n = sz(_c); vpli v(n); rep(i,n) v[i] = {_c[i], i}; sort(rrng(c)); c.clear(); d.clear(); rep(i,n){ int j = v[i].se; c.pb(_c[j]); d.pb(_d[j]); } } vvl dp(mx, vl(m+1,-LINF)); dp[0][0] = 0; rep(i,n){ rrep(j,mx-1){ int nj = j+1; rep(k,m){ if (dp[j][k]==-LINF) continue; int nk = k + c[i] * (1<m) break; chmax(dp[nj][nk], dp[j][k] + d[i]); } } } ll ans = 0; rep(i,mx) rep(j,m+1) chmax(ans, dp[i][j]); ans += sum; out; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }