# UVa 10130 – SuperSale

Problem Link : https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1071

## Solution Idea:

This is a classical knapsack problem. Just run a knapsack for every persons capacity and sum up the price taken by that person. total sum is the ans.

In this problem we need not to clear the whole dp array for every person. Because the weight and price is not changing for every person. they remain same all the time for a test case. So we have to clear the dp array once for every test case.

```
/*
+-+ +-+ +-+
|R| |.| |S|
+-+ +-+ +-+
*/

#include <bits/stdc++.h>

#define pii             pair <int,int>
#define sc              scanf
#define pf              printf
#define Pi              2*acos(0.0)
#define ms(a,b)         memset(a, b, sizeof(a))
#define pb(a)           push_back(a)
#define MP              make_pair
#define db              double
#define ll              long long
#define EPS             10E-10
#define ff              first
#define ss              second
#define sqr(x)          (x)*(x)
#define D(x)            cout<<#x " = "<<(x)<<endl
#define VI              vector <int>
#define DBG             pf("Hi\n")
#define MOD             100007
#define MAX             10000
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)           (int)a.size()
#define sf(a)           scanf("%d",&a)
#define sfl(a)          scanf("%lld",&a)
#define sff(a,b)        scanf("%d %d",&a,&b)
#define sffl(a,b)       scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)     scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)    scanf("%lld %lld %lld",&a,&b,&c)
#define loop(i,n)       for(int i=0;i<n;i++)
#define REP(i,a,b)      for(int i=a;i<b;i++)
#define TEST_CASE(t)    for(int z=1;z<=t;z++)
#define PRINT_CASE      printf("Case %d: ",z)
#define all(a)          a.begin(),a.end()
#define intlim          2147483648
#define inf             1000000
#define ull             unsigned long long

using namespace std;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

int n,price[1100],weight[1100];

int dp[1005][40];

int func(int idx, int w)
{
if(idx>=n) return 0;

int &ret=dp[idx][w];

if(ret!=-1) return ret;

int p=0,q=0;

if(w-weight[idx]>=0) p=price[idx]+func(idx+1,w-weight[idx]);

q=func(idx+1,w);

return ret=max(p,q);
}

int main()
{
///freopen("in.txt","r",stdin);
///freopen("out.txt","w",stdout);

int t;
sf(t);
TEST_CASE(t)
{
sf(n);
loop(i,n) sff(price[i],weight[i]);
ms(dp,-1);
ll ans=0;
int g;
sf(g);
while(g--)
{
int a;
sf(a);
ans+=func(0,a);
}
pf("%lld\n",ans);
}

return 0;
}

```
0 0 vote
Article Rating
Subscribe
Notify of