메델_project

import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int count = 0; int N = kb.nextInt(); int K = kb.nextInt(); List list = new ArrayList(); for(int i=0; i

import java.util.*; class Solution { public int solution(int[] people, int limit) { int answer = 0; Arrays.sort(people); int start = 0; int end = people.length-1; while(start

class Solution { public int[] solution(int brown, int yellow) { int[] answer = new int[2]; int sum = brown + yellow; for(int i=1; i row){ break; } if(yB == yellow){ answer[0] = row; answer[1] = col; break; } } return answer; } }

import java.util.*; class Solution { public int solution(int k, int[] tangerine) { int answer = 0; int sum = 0; Map map = new HashMap(); for(int x: tangerine){ map.put(x, map.getOrDefault(x, 0)+1); } List list = new ArrayList(map.values()); Collections.sort(list, Collections.reverseOrder()); for(int x: list){ if(sum + x >= k){ answer++; break; }else{ sum += x; answer++; } } return answer; } }

import java.util.*; class Solution { public int solution(String t, String p) { int answer = 0; long longP = Long.parseLong(p); for(int i=0; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int N = kb.nextInt(); int count = 0; int start = 1; int end = 1; int sum = 0; while (start N) { sum -= start; start++; } else { count++; sum += end; end++; } } System.out.print(count); } }

class Solution { public int solution(int[] number) { int answer = 0; for(int i=0; i

import java.util.*; class Solution { public int solution(int[] ingredient) { int answer = 0; Stack stack = new Stack(); for(int x: ingredient){ stack.push(x); if(stack.size()>=4){ if(stack.get(stack.size()-4) == 1 && stack.get(stack.size()-3) == 2 && stack.get(stack.size()-2) == 3 && stack.get(stack.size()-1) == 1 ){ answer++; stack.pop(); stack.pop(); stack.pop(); stack.pop(); } } } return answ..

import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int[][] map; static int N, M; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; public static void main(String[] args) { Scanner kb = new Scanner(System.in); N = kb.nextInt(); M = kb.nextInt(); map = new int[N][M]; for (int i = 0; i < N; i++) { String a = kb.next(); for (int ..

import java.util.*; public class Solution { public int solution(int n) { int ans = 0; while(n>0){ if(n%2 == 0){ n = n/2; }else{ n = n-1; ans++; } } return ans; } }