Party Schedule WA

[ztumpach_sof]

I'm trying to solve Party Schedule problem and getting a Wrong Answer when I submit.
Can somebody tell me whats wrong with it ? Please help me

import java.util.Scanner;

public class PARTY
{
static // Instance-scope fields
String print ="";
int n; // Number of objects
Item[] avail;// Available objects for use
Item[] used; // objects actually used
int nUsed;
int maxWeight; // Weight limit of the knapsack.
static boolean end=true;
static Scanner inp ;

public static void main ( String[] args ) throws Exception
{
PARTY knap = new PARTY();
inp = new Scanner (System.in);
while(end==true){
boolean vratil= knap.initialize(inp);
if(vratil==true){
knap.fill();
knap.report();
}
}
System.out.println(print);
}
public void selectionSort(){
for(int i = 0; i < avail.length - 1; i++){
int maxIndex = i;
for(int j = i + 1; j < avail.length; j++){
if(avail[j].vpw > avail[maxIndex].vpw) maxIndex = j;
}
Item tmp = avail[i];
avail[i] = avail[maxIndex];
avail[maxIndex] = tmp;
}
}
public boolean initialize(Scanner inp) throws Exception
{
boolean ok = true;
String lineIn;

  lineIn = inp.next();
  maxWeight = Integer.parseInt(lineIn.trim());

  lineIn = inp.next();
  n = Integer.parseInt(lineIn.trim());
  
  if(maxWeight==0 && n==0){
  		end=false;
  		ok= false;  
  	}
  		if(maxWeight>500 || n>100){
  			ok= false;  
  	for(int i=0;i<=n;i++){
  			  inp.nextLine();
  		  }

  		}
  if(maxWeight<=500 && n<=100){
  used  = new Item[n];
  avail = new Item[n];
  int wt,val;
  for ( int k = 0; k < n; k++ )
  {  
  lineIn = inp.next();
      wt  =   Integer.parseInt(lineIn.trim());
     lineIn = inp.next();
     val =   Integer.parseInt(lineIn.trim());

     if(5<=wt&&wt<=25&&0<=val&&val<=10){
     avail[k] = new Item(wt, val);
     }
     else{
    	 avail[k] = new Item(0, 0);
     }
  	}
	  }
 return ok;

}

void fill()
{ int k;
Item nxt;
double remain = maxWeight;
nUsed = 0;

  selectionSort();

  for ( k = 0 ; remain > 0 && k < avail.length ; k++ )
  {  nxt = avail[k];
     if ( nxt.w <= remain && nxt.v !=0 ){
        nxt.x = 1;
    
     remain -= nxt.x * nxt.w;
     used[nUsed++] = nxt;
     }
  }

}

void report()
{
int fun = 0, money=0;
for ( int k = 0; k < nUsed; k++ )
{
money=money+(int)used[k].w;
fun=fun+(int)(used[k].v);
}
print=print+ money+" "+fun+ "\n";
System.out.println();
}
}

class Item implements Comparable
{ double w, // For each object, the weight of the object
v, // For each object, the value of the object
x; // For each object, the fraction of the object used
double vpw; // For each object, the value-per-weight ratio

Item(double w, double v)
{ this.x = 0; this.w = w; this.v = v; this.vpw = v / w; }

Item(Item c)
{ this.w = c.w; this.w = c.w; this.v = c.v; this.vpw = c.vpw; }

// Comparable insists on the following method signature:
public int compareTo(Object x)
{ Item rt = (Item) x;

 return vpw < rt.vpw? +1 : vpw > rt.vpw ? -1 : 0;

}
}

[veronicacarter]

I will used your concept in my project work your logic and knowledge of subject is appreciable I like your way of coding As per the my knowledge I not found any mistake in it .Checked if any minor mistake like coma and space while you compile programme in your system .

[fabioaraujods]

The name of the class must be "Main" to work on SPOJ, try this ...

[sinisteraadi]

Can anyone please tell me the test cases where my code fails?????????

include

using namespace std;
void sort(double a[],double b[],double c[],int l)
{
for(int i=0;i {
for(int j=0;j {
if(a[j]>a[j+1])
{
double temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
} //if ends
else if(a[j]==a[j+1])
{
if(b[j]>b[j+1])
{
double temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
} // inside if ends
} //else if ends
} //for j loop ends
} //for i loop ends
} // function ends

main()
{
double m;int n;
while(cin>>m>>n&&(m!=0||n!=0))
{
double e[100]={0},fun[100]={0},rate[100]={0};
for(int i=0;i {
cin>>e[i]>>fun[i];
rate[i]=fun[i]/e[i];
}
sort(rate,e,fun,n);
double sum=0.0,tot_fun=0.0;
for(int i=n-1;;i--)
{
if(sum+e[i]<=m)
{
sum+=e[i];
tot_fun+=fun[i];
}
else break;

  }
  cout<<sum<<" "<<tot_fun<<endl;
  cout<<endl;
  }
 // system("pause");
  }

[leppyr64]

You can't greedily choose the most fun per dollar(fpd). This will leave you in a situation where you could have taken two lesser fpd items to get a higher total fun.

[sinisteraadi]

Please tell me the test cases where it will fail as i'm still clueless about my code's failure???????????????//
And can there be a party with 0 fun or o entrance fees??????????

[leppyr64]

Budget 8
Cost fun
5 20
4 12
4 11

The following n lines contain two numbers each. The first number indicates the entrance fee of each party. Parties cost between 5 and 25 francs. The second number indicates the amount of fun of each party, given as an integer number ranging from 0 to 10.

[havingfun_sof]

WA
I am not getting where I am Wrong... Need Help...

include

using namespace std;
int max(int a,int b)
{
return a>b?a:b;
}

int main()
{
int maxAllowed,number;
scanf("%d%d",&maxAllowed,&number);
while(maxAllowed)
{
int knap[101][501];
bool keep[101][501]={0};
int V[number],W[number];
for(int i=0;i scanf("%d%d",&W[i],&V[i]);

for(int i=0;i<=number;i++)
{
for(int j=0;j<=maxAllowed;j++)
{
if(j==0)knap[i][j]=0;
else if(i==0)knap[i][j]=0;
else if(j else
{
knap[i][j] = max(knap[i-1][j],knap[i-1][j-W[i-1]]+V[i-1]);
if((knap[i][j] == knap[i-1][j-W[i-1]]+V[i-1]))
{
if((knap[i-1][j-W[i-1]]+V[i-1]) == knap[i-1][j])
{
if(W[i-1] keep[i][j] = 1;
}
else keep[i][j] = 1;
}
}
}
}
int i =number ,j=maxAllowed;
int val = 0;
while(true)
{
if(i==0)break;
if(keep[i][j])
{
val+=W[i-1];
i = i - 1;
j = j - W[i];
}
else
{
i = i - 1;
}
}

cout< scanf("%d%d",&maxAllowed,&number);
}

return 0;
}