Untitled

package pkg;
import java.util.Scanner;
class knaptest
{
	int n,m;
	int v[][]=new int[10][10];
	int p[]=new int[10];
	int w[]=new int[10];
	void input()
	{
		int i,j;
		Scanner s = new Scanner(System.in);
		System.out.println("enter the value of n(number of objects):");
		n=s.nextInt();
		for(i=1;i<=n;i++)
		{
			System.out.println("enter the weight & profit of--"+i+"---object");
			w[i]=s.nextInt();
			p[i]=s.nextInt();
		}
		System.out.println("enter the capacity of knapsack:");
		m=s.nextInt();
	}
	int max(int a,int b)
	{
		return a>b? a:b;
	}
	void opt_sol()
	{
		int i,j;
		for(i=0;i<=n;i++)
		{
		  for(j=0;j<=m;j++)
			{
				if(j=0;j<=m;j++)
				{
					if(i==0||j==0)
						v[i][j]=0;
					else if(j<w[i])
						v[i][j]=v[i-1][j];
					else
						v[i][j]=max(v[i-1][j],v[i-1][j-w[i]]+p[i]);
				}
			}
		}
		void output()
		{
			int i,j,x[];
			x=new int[10];
			System.out.println("the optimal solution matrix is:");
			for(i=0;i<=n;i++)
			{
				for(j=0;j<=m;j++)
				{
					System.out.println(v[i][j]+" ");
				}
				System.out.println();
			}
			System.out.println("the optimal solution is:"+v[n][m]);
			System.out.println(" ");
			for(i=0;i<=n;i++)
				x[i]=0;
			i=n;
			j=m;
			while(i!=0&&j!=0)
			{
				if(v[i][j]!=v[i-1][j])
				{
					x[i]=1;
					j=j-w[i];
				}
				i=i-1;
			}
			System.out.println("objects selected are:");
			for(i=1;i<=n;i++)
				if(x[i]==1)
					System.out.println(i);
		}
	}
public class Knap {

	public static void main(String[] args) {
		knaptest kt=new knaptest();
		kt.input();
		kt.opt_sol();
		kt.output();
	}

}