package dancinggooglers;

import java.io.File;
import java.util.Scanner;

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

package MyAllgoritmicLib;

public class Sort {
	public static int partition(int[] m, int a, int b) {
		int i = a;
		for (int j = a; j <= b; j++) // ïðîñìàòðèâàåì ñ a ïî b
		{
			if (m[j] >= m[b]) // åñëè ýëåìåíò a[j] íå ïðåâîñõîäèò
			// a[b],
			{
				int t = m[i]; // ìåíÿåì ìåñòàìè a[j] è a[a], a[a+1], a[a+2] è
				// òàê äàëåå...
				m[i] = m[j]; // òî åñòü ïåðåíîñèì ýëåìåíòû ìåíüøèå a[b] â
				// íà÷àëî,
				m[j] = t; // à çàòåì è ñàì a[b] «ñâåðõó»
				i++; // òàêèì îáðàçîì ïîñëåäíèé îáìåí: a[b] è a[i], ïîñëå ÷åãî
				// i++
			}
		}
		return i - 1; // â èíäåêñå i õðàíèòñÿ <íîâàÿ ïîçèöèÿ ýëåìåíòà a[b]> + 1
	}

	public static void quicksort(int[] m, int a, int b) // a - íà÷àëî ïîäìíîæåñòâà,
	// b -
	// êîíåö
	{ // äëÿ ïåðâîãî âûçîâà: a = 0, b = <ýëåìåíòîâ â ìàññèâå> - 1
		if (a >= b)
			return;
		int c = partition(m, a, b);
		quicksort(m, a, c - 1);
		quicksort(m, c + 1, b);
	}
}
