* My prototype will be to create Tag Cloud !

* I will provide detailed code and steps soon.

* Using Yahoo pipes to generate portfolio related xml file.

* Building application that uses this xml file for portfolio management.

* I will show detailed steps soon.

Write a program that takes a single argument on the command line. This argument must be a file name, which contains the input data. The program should output to standard out the minimum losses your boss will incur from your ejection of goods (see below). Your program will be tested against several manifests of several crashing planes; each with different data. Additionally, your program must be fast, and give the correct answer.

Input specifications
The input file will start with an integer number indicating the minimum number of pounds of weight that must be ejected from the plane to prevent a crash, followed by a new line. Each additional line in the file represents a commercial SKU (stock keeping unit) along with its cost (in dollars) and weight (in pounds). The format of these lines is:

<SKU label> <weight in pounds> <cost in dollars>

SKUs are represented as a combination of letters (upper and lower case) and numbers. Both costs and weights are integers. Each piece of data in a line is separated by white space. Lines are separated by a single new line character. You are guaranteed your program will run against well formed input files.

Example input file:

1250
LJS93K 1300 10500
J38ZZ9 700 4750
HJ394L 200 3250
O1IE82 75 10250

Output specifications
Your boss is not interested in exactly what you ejected to save the plane, he/she is currently only interested in how much it will cost the company. Your program must find the set of goods that will prevent the plane from crashing, and minimize company losses. It should print out the total value of goods lost as a plain integer, followed by a newline. Do not insert commas or dollar signs.

Example output (newline after integer):

9500

———

/*
Author : Kunal Cholera
email : kunalcholera@gmail.com
web : http://tech.kunalcholera.com
date : 31st Jan 2009
time : 11:00 pm

Problem definition : http://tech.kunalcholera.com/facebook-programming-puzzlesfacebook-programming-puzzles/

Instructions to compile : g++ f1.cpp
Instructions to execute : ./a.out

Expected output : Lowest Cost : 9500

*/

/* Input Array

1250
LJS93K 1300 10500
J38ZZ9 700 4750
HJ394L 200 3250
O1IE82 75 10250

*/

/* Array to be formed is as follows :
item cost cost/item Cost throwing only this item
700 4750 6 9500
1300 10500 8 10500
200 3250 16 22750
75 10250 136 174250

- Better improvement would be to check if there is other combinations of rows that lead to lower minimum
- replace numberOfLines variable with the actual variable depending on the file size.

*/

#include<stdio.h>
#include<iostream>

using namespace std;

int main(){

// Read and parse the input file based on tabbed data - \t

FILE *fileReader;
char *fileName = "input.txt";

fileReader = fopen( fileName, "r");

if( !fileReader ){
    cout<<"Could not open"<< fileName <<endl;
}

// Reading the weight to be thrown

int minimumWeight;
fscanf( fileReader, "%u", &minimumWeight);

// forming the array of objects and their weights
// find out the storage size of the array..

int numberOfLines = 4;
int items[numberOfLines][4];

char tempString[50];

int i=0;
int remainingLines = 4;

while( remainingLines > 0){
    fscanf( fileReader, "%s\t%u\t%u" , &tempString, &items[i][0], &items[i][1] );
    items[i][2] = items[i][1]/items[i][0]; // This stores cost per unit of item
    i++;
    remainingLines--;
}

// cout<<i<<endl;
fclose(fileReader);

// sort the matrix in ascending order of 3rd colum for having low cost weights items first.
// bubble sort variation..

int temp;
for( i=0; i< numberOfLines; i++){
    for( int j = i+1; j< numberOfLines; j++ ){
        if( items[i][2] > items[j][2] ){
        temp = items[i][0]; items[i][0] = items[j][0]; items[j][0] = temp;
        temp = items[i][1]; items[i][1] = items[j][1]; items[j][1] = temp;
        temp = items[i][2]; items[i][2] = items[j][2]; items[j][2] = temp;
       }
    }
}

// simply loop through and subtract lowest cost weight till you get minimumWeight <0
int totalCost = 0;

// cout<<minimumWeight<<endl;

int weight = minimumWeight;
for( i = 0; i< numberOfLines; i++){
    while( weight > 0 ){
        weight -= items[i][0];
        totalCost += items[i][1];
    }
    items[i][3] = totalCost;
    // cout<<"Total Cost : "<<totalCost<<endl;
    totalCost = 0;
    weight = minimumWeight;
}

// print lowest cost
int lowestCost = items[0][3];
for( i=0; i< numberOfLines; i++){
    if( items[i][3] < lowestCost ){
        lowestCost = items[i][3];
    }
}

cout<<"Lowest Cost :"<<lowestCost<<endl;

return 0;
}