찰떡개발자 코딩

1).문제 : www.hackerrank.com/challenges/mark-and-toys

2).풀이 : 

오름차순으로 정렬하면서 더하기

정렬 다하고 더하지 말고 정렬 하면서 더하자

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

    // Complete the maximumToys function below.
    static int maximumToys(int[] prices, int k) {
        int sum = 0;
        int count = 0;
        for(int i = 0 ; i < prices.length-1 ; i ++) {
            for(int j = i+1 ; j < prices.length ; j ++) {
                if(prices[i] > prices[j]) {
                    int tmp = prices[i];
                    prices[i] = prices[j];
                    prices[j] = tmp;
                }
            }
            if(sum+prices[i] > k) {
                break;
            }else {
                count++;
                sum+=prices[i];
            }
        }
        return count;
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        String[] nk = scanner.nextLine().split(" ");

        int n = Integer.parseInt(nk[0]);

        int k = Integer.parseInt(nk[1]);

        int[] prices = new int[n];

        String[] pricesItems = scanner.nextLine().split(" ");
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int i = 0; i < n; i++) {
            int pricesItem = Integer.parseInt(pricesItems[i]);
            prices[i] = pricesItem;
        }

        int result = maximumToys(prices, k);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedWriter.close();

        scanner.close();
    }
}