UVa/10130 - SuperSale.cpp at master · rmzn17/UVa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <iostream>
#include<stdlib.h>
#include <cstdio>
#include<sstream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define vc vector<int>
#define pb push_back
#define pf printf
#define mxpq priority_queue<int>
#define mnpq priority_queue<int,vector<int>,compare>
#define ms(a) memset(a,0,sizeof(a));
#define input(s) getline(cin,s);
#define mpii map<int,int>
#define mpsi map<string,int>
#define str string s;
#define sz size();
#define ln strlen(s);
#define gcd(x,y)  __gcd(x,y)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define mn2(a, b) (a<b?a:b)
#define mn3(a, b, c) mn2(a, mn2(b, c))
#define mn4(a, b, c, d) mn2(a, mn2(b, mn2(c, d)))
#define mx2(a, b) (a>b?a:b)
#define mx3(a, b, c) mx2(a, mx2(b, c))
#define mx4(a, b, c, d) mx2(a, mx2(b, mx2(c, d)))
#define max 1000001
#define Pinf 99999999999
#define Ninf -99999999999
#define PI acos(-1)
#define MOD 1000000007

using namespace std;


int values[1005];
int weight[1005];
int profit[1005][1005];
int items,maxweight;

int knapsack()
{
    int i,j,w;
    for(i=0; i<=items; i++)
    {
        profit[i][0]=0;
    }
    for(w=0; w<=maxweight; w++)
    {
        profit[0][w]=0;
    }


    for(i=1; i<=items; i++)
    {

        for(w=0; w<=maxweight; w++)
        {
            if(weight[i]>w)
            {
                profit[i][w]=profit[i-1][w];
            }
            else
            {
                if(profit[i-1][w]>=profit[i-1][w-weight[i]]+values[i])
                {
                    profit[i][w]=profit[i-1][w];

                }
                else
                {
                    profit[i][w]=profit[i-1][w-weight[i]]+values[i];
                }
            }
        }
    }
    return profit[items][maxweight];
}


int main()
{
    int i,j,k,tc;
    int maxprofit;
    scanf("%d",&tc);
    while(tc--)
    {
        maxprofit=0;
        scanf("%d",&items);
        for(i=1; i<=items; i++)
        {
            scanf("%d%d",&values[i],&weight[i]);
        }
        int total_person;
        scanf("%d",&total_person);
        while(total_person--)
        {
            scanf("%d",&maxweight);
            int temp=knapsack();
            maxprofit+=temp;
        }
        printf("%d\n",maxprofit);
    }
return 0;
}