package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

package er.dream.codejam.train;

import java.util.ArrayList;
import java.util.List;

import er.dream.codejam.helpers.ProblemSolver;

public class DancingWithGooglers extends ProblemSolver{
	
	public static void main(String[] args) {
		new DancingWithGooglers().execute();
	}

	@Override
	protected List<String> handleInput() {
		List<String> result = new ArrayList<String>();
		int[] settings = fileHandler.readIntArray();
		
		for(int i=0;i<settings[0];i++){
			int[] numbers = fileHandler.readIntArray();
			int surprises = numbers[1];
			int minScore = numbers[2];
			
			int minimumScoreForUnsurprising = Math.max(0,3*minScore-2);
			int minimumScoreForSurprising = Math.max(0, 3*minScore-4);
			
			int surprisesMax = 0;
			int unsuprising = 0;
			
			int score;
			for(int j=3;j<numbers.length;j++){
				
				score = numbers[j];
				if(score < minScore)
					continue;
				
				if(score >= minimumScoreForUnsurprising)
					unsuprising++;
				else if(score >= minimumScoreForSurprising)
					surprisesMax++;
			}
			int maxGooglers = unsuprising + Math.min(surprises,  surprisesMax);
			result.add(""+maxGooglers);
		}
		
		return result;
	}

}
