UVa11776 - Oh Your Royal Greediness!

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.FileReader;
import java.io.InputStream;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;

class Main
{
	public static final boolean DEBUG = false;	
	public Node[] node;
	public int t, n;
	
	class Node implements Comparable<Node>
	{
		int x, y;
		boolean ok;
		
		public int compareTo(Node other) 
		{
			return x - other.x;
		}
	}
	
	public void init(InputStream in)
	{
		Reader.init(in);
		t = 0;
	}
	
	public boolean input() throws IOException
	{
		n = Reader.nextInt();
		
		if (n == -1) return false;
		
		t++;
		node = new Node[n];
		
		for (int i = 0; i < n; i++) {
			node[i] = new Node();
			node[i].x = Reader.nextInt();
			node[i].y = Reader.nextInt();
			node[i].ok = false;
		}
		
		return true;
	}
	 
	
	public void solve()
	{
		Arrays.sort(node);
		
		int ans = 0;
		
		for (int i = 0; i < n; i++) {
			if (node[i].ok) continue;
			ans++;
			
			int y = node[i].y;
			
			for (int j = i + 1; j < n; j++) {
				if (!node[j].ok && y < node[j].x) {
					node[j].ok = true;
					y = node[j].y;
				}
			}
		}
		
		System.out.println("Case " + t + ": " + ans);
	}
	
	public static void main(String[] args) throws IOException
	{
		Main solver = new Main();
		
		solver.init(System.in);
		while (solver.input()) {
			solver.solve();
		}
	}
}

class Reader
{
	static BufferedReader reader;
	static StringTokenizer tokenizer;
	
	static void init(InputStream input)
	{
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}
	
	static String next() throws IOException
	{
		while (!tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		
		return tokenizer.nextToken();
	}
	
	static int nextInt() throws IOException
	{
		return Integer.parseInt(next());
	}
}