cf360C

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

void OneZeroPack(int cost,int value)
{
for ( int i = m ; i >= cost ; i--)
dp[i] = max(dp[i],dp[i-cost]+value);
}

int main()
{
int n,k;
const int N=1E4+5;
int dp[N],a[N],b[N],c[n];
scanf("%d %d",&n,&k);
for ( int i = 1 ; i <= n ; i++)
scanf("%d %d",&a[i],&b[i]);
for ( int i = 1 ; i <= n ; i++)
c[i] = a[i] - k*b[i];
for ( int i = 1 ; i <= n ; i++)

return 0;
}