Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions 2020-Freshers/goodie-dilemma/CODE
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
https://github.com/ganesh1930m/Hello_world/commit/c81dd60846b2301555b3624f2fcd229f215ec838
Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

import java.io.;
import java.util.
;
class Item {
String name;
int price;

public Item(String name, int price) {
this.name = name;
this.price = price;
}

public String toString() {
return this.name + ": " + this.price;
}
}

public class Main {
public static void main(String[] args) throws Exception {
FileInputStream fis=new FileInputStream("input.txt");
Scanner sc=new Scanner(fis);
int number_of_employees = Integer.parseInt(sc.nextLine().split(": ")[1]);
sc.nextLine(); sc.nextLine(); sc.nextLine();

ArrayList<Item> goodies_items = new ArrayList<Item>();

while(sc.hasNextLine())  
{
  String current[] = sc.nextLine().split(": ");
  goodies_items.add(new Item(current[0], Integer.parseInt(current[1])));
}
sc.close();

Collections.sort(goodies_items, new Comparator<Item>(){
  public int compare(Item a, Item b) { 
    return a.price - b.price; 
  } 
});

int min_diff = goodies_items.get(goodies_items.size()-1).price;
int min_index = 0;
for(int i=0;i<goodies_items.size()-number_of_employees+1;i++) {
  int diff = goodies_items.get(number_of_employees+i-1).price-goodies_items.get(i).price;

  if(diff<=min_diff) {
    min_diff = diff;
    min_index = i;
  }
}



FileWriter fw = new FileWriter("output.txt");
fw.write("The goodies selected for distribution are:\n\n");
for(int i=min_index;i<min_index + number_of_employees; i++) {
  fw.write(goodies_items.get(i).toString() + "\n");
}

fw.write("\nAnd the difference between the chosen goodie with highest price and the lowest price is " + min_diff);
  fw.close();

}
}