代码：

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

struct node
{
	int v, p;
};
node a[110];

bool cmp(node a, node b)
{
	if (a.v != b.v) return a.v < b.v;
	return a.p < b.p; 
}

int main()
{
    int n, w;
    cin >> n >> w;
    for (int i = 1; i <= n; i++)
    {
    	cin >> a[i].v >> a[i].p;
	}
	sort (a + 1, a + 1 + n, cmp);
	int ans = 0, all = 0;
	for (int i = 1; i <= n; i++)
	{
		all += a[i].v;
		if (all > w) break;
		ans += a[i].p;
	}
	cout << ans;
    return 0;
}