Interesting problem

Question

Hello All,
This is the problem I am stuck with right now.
I have two array lists one producer array list and one consumer array list denoted by a and b
P1 P2 P3 P4 P5
5 6 7 8 9
C1 C2 C3 C4 C5
2 3 4 5 6
Now we find all those producer consumer pairs which satisfy the criteria Pi>=Ci
We have the following sets
(5,2)(6,2)(7,2),(8,2),(9,2)
(5,3)(6,3)(7,3),(8,3),(9,3)
(5,4)(6,4)(7,4),(8,4),(9,4)
(5,5)(6,5)(7,5),(8,5),(9,5)
(6,6)(7,6)(8,6),(9,6)
Let us done each of them with Si
so we have S1,S2,S3,S4,S5
we assign a third parameter called weight to each element in Si which has satisfied the condition Pi>=Ci;
so we we will have
(5,2,ai),(6,2,bi),(7,2,ci)....etc for S1
similarly for S2 and so on.
We need to find in each set Si the the pair which has the smallest weight.
if we have (5,2,3) and (6,2,4) then 5,2,3 should be chosen.We should make sure that there is only one pair in every set which is finally chosen on the basis of weight.
Suppose we get a pair (5,2,3) in S1 and (5,2,3) in S2 we should see that (5,2,3) is not used to compare to compare with any other elements in the same set S2,
Finally we should arrive at the best element pair in each set.They should be non repeating in other sets.
Given a problem
P0 P1 P2 P3 P4
9 5 2 2 8
6 5 4 5 3
C0 C1 C2 C3 C4
we have So as (P0,C0) and (P4,C0)
assuming that the one with the smaller index has lesser weight PO is selected.In the program I have used random weights.from set S1 we select the pair PO,CO
S1 =(P0,C1),(P1,C1) and (P4,C1)
since P0 and P4 are already used in previous set we dont use them for checking in S1 so we have (P1,C1) as best.
S2=(P0,C2),(P1,C2) and (P4,C2) so we dont use P0,C2 and P1 and C2 because PO and P1 are already used in S1.
So we choose P4,C2
in S3 and S4 ae have (P0,C3),(P1,C3),(P4,C3) so we dont choose anything
and same in S4 also.
So answer is
(P0,C0),(P1,C1) and (P4,C2).
My program is trying to assign weights and I am trying to print the weights along with the sets.It doesnt work fine.I need help to write this program to do this.
Thanks.
Regards.
NP
import java.util.*;
class Pairs {
public static void main(String [] arg) {
int k;
List a = new ArrayList();
List b = new ArrayList();
for(k=0;k<3;k++)
a.add(new Integer(((int)(StrictMath.random()*10 + 1))));
System.out.println("The Producer values are");
for(k=0;k<3;k++)
System.out.println(((Integer)a.get(k)).intValue());
for(k=0;k<3;k++)
b.add(new Integer(((int)(StrictMath.random()*10 + 1))));
System.out.println("The Consumer values are");
for(k=0;k<3;k++)
System.out.println(((Integer)b.get(k)).intValue());
// these lines nec. if List a,b are not in ascending order already
List rows = new ArrayList();
for(Iterator i = b.iterator(); i.hasNext(); )
int bi = ((Integer) i.next()).intValue();
List row = new ArrayList();
List weights= new ArrayList();
for(int j=0; j<a.size(); j++)
if(((Integer)a.get(j)).intValue()>=bi)
weights.add(new Integer (((int)(StrictMath.random()*10 + 1))));
row.add("("+bi+","+((Integer)a.get(j)).intValue()+ "," +((Integer)weights.get(j)).intValue()+")");
else
row.add("null");
weights.add("none");
rows.add(row);
System.out.println(rows);
List temp=new ArrayList();
//List temp1=new ArrayList();
int j=0;
System.out.println("List after being printed");
for(Iterator i=rows.iterator();i.hasNext();)
temp=(ArrayList)i.next();
if(((String)temp.get(0))!="null")
System.out.println( ((String)(temp.get(0))).charAt(5));
j++;

Answer 1

Sorry I can't help with your problem
but I must point two things out:
1. Please reply to the existing thread, not create a
new one each time you want to update us
2. Please put the tag [ code] in front of your code
and [ /code] at the end (without the spaces I put in).
This should make the code much more readable.