Fractional knapsack using greedy algorithm

/* program to implement fractional knapsack problem using greedy programming */
#include<iostream>
using namespace std;
int main()
{
    int array[2][100],n,w,i,curw,used[100],maxi=-1,totalprofit=0;
    //input number of objects
    cout<<"Enter number of objects: ";
    cin>>n;
    //input max weight of knapsack
    cout<<"Enter the weight of the knapsack: ";
    cin>>w;
    /* Array's first row is to store weights
    second row is to store profits */
    for(i=0;i<n;i++)
    {
        cin>>array[0][i]>>array[1][i];
    }
    for(i=0;i<n;i++)
    {
        used[i]=0;
    }
    curw=w;
    //loop until knapsack is full
    while(curw>=0)
    {
        maxi=-1;
        //loop to find max profit object
        for(i=0;i<n;i++)
        {
            if((used[i]==0)&&((maxi==-1)||(((float)array[1][i]/(float)array[0][i])>((float)array[1][maxi]/(float)array[0][maxi]))))
            {
                maxi=i;
            }
        }
        used[maxi]=1;
        //decrease current wight
        curw-=array[0][maxi];
        //increase total profit
        totalprofit+=array[1][maxi];
        if(curw>=0)
        {
            cout<<"\nAdded object "<<maxi+1<<" Weight: "<<array[0][maxi]<<" Profit: "<<array[1][maxi]<<" completely in the bag, Space left: "<<curw;
        }
        else
        {
            cout<<"\nAdded object "<<maxi+1<<" Weight: "<<(array[0][maxi]+curw)<<" Profit: "<<(array[1][maxi]/array[0][maxi])*(array[0][maxi]+curw)<<" partially in the bag, Space left: 0"<<" Weight added is: "<<curw+array[0][maxi];
            totalprofit-=array[1][maxi];
            totalprofit+=((array[1][maxi]/array[0][maxi])*(array[0][maxi]+curw));
        }
    }
    //print total worth of objects filled in knapsack
    cout<<"\nBags filled with objects worth: "<<totalprofit;
    return 0;
}

import java.io.*;

class fracknapsack
{
	public static void main(String args[]) throws IOException
	{
		int i,j=0,max_qty,m,n;
		float sum=0,max;
		           BufferedReader cin= new BufferedReader (new InputStreamReader(System.in));
		int array[][]=new int[2][20];
		System.out.println("enter no of items");
		n=Integer.parseInt(cin.readLine());
		for(i=0;i<n;i++)
		{
			System.out.println("enter maximum volume of item no " + (i+1) + " is : ");
			array[0][i]=Integer.parseInt(cin.readLine());
		}
		for(i=0;i<n;i++)
		{
			System.out.println("enter total profit of item no " + (i+1) + " is : ");
			array[1][i]=Integer.parseInt(cin.readLine());
		}
		System.out.println("enter maximum volume of knapsack :");
		max_qty=Integer.parseInt(cin.readLine());
		m=max_qty;
		while(m>=0)
		{
			max=0;
			for(i=0;i<n;i++)
			{
				if(((float)array[1][i])/((float)array[0][i])>max)
				{
					max=((float)array[1][i])/((float)array[0][i]);
					j=i;
				}
			}
			if(array[0][j]>m)
			{
				System.out.println("qty of item no " +  (j+1) + " added is " +m);
				sum+=m*max;
				m=-1;
			}
			else
			{
				System.out.println("qty of item no " + (j+1) + " added is " + array[0][j]);
				m-=array[0][j];
				sum+=(float)array[1][j];
				array[1][j]=0;
			}
		}
		System.out.println("total profit is " + sum);
	}
}