package Sort;

import java.util.*;
public class prog_1_실패율 {

    class Fail{
        int stage;
        double rate;
        
        Fail(int stage, double rate){
            this.stage = stage;
            this.rate = rate;
        }
    }
    
    public int[] solution(int N, int[] stages) {
        int fail[] = new int[N+2];
        double sum = stages.length;
        for(int i=0; i<stages.length; i++){
            fail[stages[i]]++;
        }
        
        LinkedList<Fail> faill = new LinkedList<>();
        
        for(int i=1; i<=N; i++){
            if(fail[i] !=0){
                faill.add(new Fail(i, fail[i]/sum));
                sum = sum-fail[i];
            }
            else
                faill.add(new Fail(i, 0));
        }
        
        Comparator<Fail> comp = new Comparator<Fail>(){
            public int compare(Fail a, Fail b){ // rate로 내림차순
                if(a.rate < b.rate)
                    return 1;
                else if(a.rate > b.rate)
                    return -1;
                
                return 0;
            }
        };
         
        Collections.sort(faill,comp);
        
        int answer[] = new int[N];
     
        for(int i=0; i<N; i++)
            answer[i] = faill.get(i).stage;
        
        return answer;
    }
}

package Stack_Queue;

import java.util.*;
//아니... 터지면 +1인줄 알았지 누가 2인줄 알았나..하..
public class prog_크레인인형뽑기게임 {

    static int b[][];
    static int n;
    static LinkedList<Integer> stk = new LinkedList<>();
    
    void go(int k){
        for(int i=1; i<=n; i++){
            if(b[i][k] !=0){
                stk.add(b[i][k]);
                b[i][k] = 0;
                break;
            }
        }    
    }
    
    public int solution(int[][] board, int[] moves) {
        int answer = 0;
        b = new int[board.length+1][board.length+1];
        n = board.length;
            
        for(int i=board.length-1; i>=0; i--){
            for(int j=0; j<board[0].length; j++)
                b[i+1][j+1] = board[i][j];
        }
        
        
        for(int i=0; i<moves.length; i++){
            go(moves[i]);//stk에 넣고
         
            if(stk.size()>=2 && stk.getLast() == stk.get(stk.size()-2)){
                stk.removeLast();
                stk.removeLast();
                answer += 2;
            }
                
        }
        
        return answer;
    }
}

package Dfs_Bfs;

import java.util.*;
public class beak_re_체스판다시칠하기 {
	static StringBuilder even1;
	static StringBuilder even2;
	
	static int even(char arr[][]) {
		int sum = 0;	
		int num = 1;
		
		for(int i=0; i<8; i++, num++) {
			if(num%2==0) {
				for(int j=0; j<8; j++) {
					if(even1.charAt(j) != arr[i][j])
						sum++;
				}
			}
			
			else {
				for(int j=0; j<8; j++) {
					if(even2.charAt(j) != arr[i][j])
						sum++;
				}
			}
		}
		return sum;
	}
	
	static int odd(char arr[][]) {
		int sum = 0;
		int num = 1;
		
		for(int i=0; i<8; i++, num++) {
			if(num%2==0) {
				for(int j=0; j<8; j++) {
					if(even2.charAt(j) != arr[i][j])
						sum++;
				}
			}
			
			else {
				for(int j=0; j<8; j++) {
					if(even1.charAt(j) != arr[i][j])
						sum++;
				}
			}
		}
		return sum;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int m = sc.nextInt();
		
		sc.nextLine();
		
		char arr[][] = new char[n][m];
		even1 = new StringBuilder();
		even2 = new StringBuilder();
		
		for(int i=0; i<n; i++) {
			String s = sc.nextLine();
			for(int j=0; j<m; j++)
				arr[i][j] = s.charAt(j);
		}
		
		int num = 1;
		for(int i=0; i<m; i++, num++) {
			if(num%2==0) {
				even1.append("B");
				even2.append("W");
			}
			else {
				even1.append("W");
				even2.append("B");
			}
		}
		
		char copy_arr[][] = new char[8][8];
		int min = Integer.MAX_VALUE;
		
		for(int i=0; i<n-8+1; i++) {//행을 내리고
			for(int j=0; j<m-8+1; j++) {
				for(int k=0; k<8; k++) {
					for(int l=0; l<8; l++) {
						copy_arr[k][l] = arr[k+i][l+j];
					}
				}
				
				int n1 = even(copy_arr);
				int n2 = odd(copy_arr);
				
				min = Math.min(min, Math.min(n1, n2));	
			}
		}
		
		System.out.println(min);
	}
}

package bruteforce_re;

import java.util.*;

public class beak_re_로또 {

	static LinkedList<Integer> result;
	static LinkedList<Integer> arr;
	
	public static void comb(int num) {
		if(num == 6) {
			StringBuilder sb = new StringBuilder();
			for(int i : result)
				sb.append(i + " ");
			System.out.println(sb);
		}
		
		for(int i=0; i<arr.size(); i++) {
			if(result.contains(arr.get(i)))
				continue;
			if(!result.isEmpty() && i<arr.indexOf(result.getLast()))
				continue;
			
			result.add(arr.get(i));
			comb(num+1);
			result.removeLast();	
		}
		
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(true) {
			String s = sc.nextLine();
			if(s.equals("0"))
				break;
			
			String ss[] = s.split(" ");
			int n = Integer.parseInt(ss[0]);
			
			result = new LinkedList<>();
			arr = new LinkedList<>();
			
			arr.sort(null);
			
			for(int i=1; i<=n; i++)
				arr.add(Integer.parseInt(ss[i]));
	
			comb(0);
			System.out.println("");
		}
		
	}
}

package DP;

import java.util.*;
public class prog_re_야근지수 {

	static public long solution(int n,int works[]) {
		long res = 0;
		
		PriorityQueue<Long> pq = new PriorityQueue<>(Collections.reverseOrder());
		
        long sum = 0;
		for(long work: works) {
			pq.add(work);
            sum += work;
		}
		
        if(sum <=n)
            return 0;
        
		for(int i=0; i<n; i++) {
			long now = pq.poll();
			pq.add(now-1);
		}
		
		for(long i : pq)
			res += (i*i);
		
		return res;
	}
}