/****************************************************************************** * Compilation: javac TopM.java * Execution: java TopM m < input.txt * Dependencies: MinPQ.java Transaction.java StdIn.java StdOut.java * Data files: https://algs4.cs.princeton.edu/24pq/tinyBatch.txt * * Given an integer m from the command line and an input stream where * each line contains a String and a long value, this MinPQ client * prints the m lines whose numbers are the highest. * * % java TopM 5 < tinyBatch.txt * Thompson 2/27/2000 4747.08 * vonNeumann 2/12/1994 4732.35 * vonNeumann 1/11/1999 4409.74 * Hoare 8/18/1992 4381.21 * vonNeumann 3/26/2002 4121.85 * ******************************************************************************/ package edu.princeton.cs.algs4; /** * The {@code TopM} class provides a client that reads a sequence of * transactions from standard input and prints the m largest ones * to standard output. This implementation uses a {@link MinPQ} of size * at most m + 1 to identify the M largest transactions * and a {@link Stack} to output them in the proper order. *
* For additional documentation, see Section 2.4
* of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
*
* @author Robert Sedgewick
* @author Kevin Wayne
*/
public class TopM {
// This class should not be instantiated.
private TopM() { }
/**
* Reads a sequence of transactions from standard input; takes a
* command-line integer m; prints to standard output the m largest
* transactions in descending order.
*
* @param args the command-line arguments
*/
public static void main(String[] args) {
int m = Integer.parseInt(args[0]);
MinPQ