-
Notifications
You must be signed in to change notification settings - Fork 1
/
CV2B.cpp
104 lines (101 loc) · 2.69 KB
/
CV2B.cpp
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
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,x,n,z,c,j,total=0,maxprice=0,maxpiz=0,minprice=99999999,minpiz=0;
cin>>x>>n;
double combo[x+1],price[x+1],ppp[x+1];
int demand[n+1];
for(i=0;i<x;i++)
{
cin>>combo[i];
}
for(i=0;i<x;i++)
{
cin>>price[i];
ppp[i]=((price[i])/combo[i]);
if(price[i]>maxprice)
{
maxprice=price[i];
maxpiz=combo[i];
}
if(price[i]<minprice)
{
minprice=price[i];
minpiz=combo[i];
}
//cout<<ppp[i]<<" *";
}
for(i=0;i<n;i++)
{
cin>>demand[i];
total+=demand[i];
}
for (int j = 1; j < x; j++)
{
double key = ppp[j];
double key1=price[j];
double key2=combo[j];
int i = j-1;
//cout<<"#"<<ppp[i]<<" "<<key<<"#";
while ( (i >=0 ) && ( ppp [i] > key ) )
{
//cout<<"%"<<i<<"%";
ppp [i+1] = ppp [i];
price[i+1]=price[i];
combo[i+1]=combo[i];
i--;
}
ppp[i+1] = key;
price[i+1]=key1;
combo[i+1]=key2;
}
//for (int j = 0; j < x; j++)
// cout<<combo[j]<<" ";
int piz=total,max_price=0;
for(i=x-1;i>=0;i--)
{
while(piz-combo[i]>=0)
{
piz-=combo[i];
max_price+=price[i];
}
}
if(piz>0)
{
while(piz>0)
{
piz -= maxpiz;
max_price += maxprice;
}
}
//cout<<max_price;
piz=total;
int min_price=0;
for(i=0;i<=x-1;i++)
{
while(piz-combo[i]>=0)
{
piz-=combo[i];
min_price+=price[i];
}
}
if(piz>0)
{
while(piz>0)
{
piz -= minpiz;
min_price += minprice;
}
}
cout<<max_price-min_price;
if(t)
cout<<endl;
}
return 0;
}