-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathknap.java
More file actions
73 lines (70 loc) · 2.13 KB
/
knap.java
File metadata and controls
73 lines (70 loc) · 2.13 KB
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
import java.util.Scanner;
public class knap{
int get_next(double p_w[],int N){
int index = -1;
double largest = p_w[0];
for(int i =0;i<N;i++){
if(p_w[i] >= largest)
{
largest = p_w[i];
index = i;
}
}
p_w[index] = -1;
return index;
}
void fill_knap(int N,double C ,double p[],double w[],double[] p_w){
double cw=0,cp=0;
int flag[] = new int[N];
for(int i=0;i<N;i++){
flag[i] = 0;
}
while(cw < C){
int item = get_next(p_w,N);
flag[item] = 1;
if(item == (-1))
break;
if((cw + w[item]) <= C){
cp += p[item];
cw += w[item];
}
else{
cp += p[item]*((C-cw)/w[item]);
break;
}
}
for(int i=0;i<N;i++){
if(flag[i] == 0){
System.out.println("object " + (i+1) + " was not picked.");
}
else{
System.out.println("object " + (i+1) + " was picked.");
}
}
System.out.println("max profit obtained is : " + cp);
}
public static void main(String args[]){
knap n = new knap();
double p[] = new double[20];
double w[] = new double[20];
double ratio[] = new double[20];
Scanner scan = new Scanner(System.in);
System.out.println("Enter number of elements : ");
int N = scan.nextInt();
System.out.println("Enter profits : ");
for(int i =0;i<N;i++){
p[i] = scan.nextDouble();
}
System.out.println("Enter weights : ");
for(int i =0;i<N;i++){
w[i] = scan.nextDouble();
}
System.out.print("Enter capacity : ");
double C = scan.nextDouble();
for(int i=0;i<N;i++){
ratio[i] = p[i]/w[i]; // int/int will not be converted to int
}
n.fill_knap(N, C, p, w, ratio);
scan.close();
}
}