더 맵게

import java.util.*;
 
class Solution {
    public int solution(int[] scoville, int k) {
        int answer = 0;
        int first = 0 ;
        int second = 0 ;
        int result = 0 ;
        int index = 0 ; 
        
        while(true){
            Arrays.sort(scoville);
            if(scoville[index] >= k ){
                break;
            }
            if(index<scoville.length-1){
                first = scoville[index];
                scoville[index] = 0;
                second = scoville[index+1] *2;
                result = first+second;
                index++;
                scoville[index] = result;
                answer++;                
            }else{
                break;
            }
        }
        if(result < k) answer = -1;
        return answer;
    }
}