Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions 03월/2주차/[BOJ] 부분 문자열/Min.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class Min {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

while (true) {
String st = br.readLine();
if(st == null) break;
Comment on lines +11 to +12
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

입력이 끝나는 부분이 깔끔하게 처리된 것 같아요! 배워갑니다 👍


StringTokenizer str = new StringTokenizer(st);
String s = str.nextToken();
String t = str.nextToken();
int idx = 0;

for(int i = 0; i < t.length(); i++) {
if(s.charAt(idx) == t.charAt(i)) {
idx += 1;
}
if(idx == s.length()) break;
}

System.out.println(idx == s.length() ? "Yes" : "No");
}

}
}
31 changes: 31 additions & 0 deletions 03월/2주차/[BOJ] 최소 회의실 개수/Min.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Min {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
int[][] arr = new int[N][2];
for(int i = 0; i < N; i++) {
StringTokenizer str = new StringTokenizer(br.readLine());
arr[i][0] = Integer.parseInt(str.nextToken());
arr[i][1] = Integer.parseInt(str.nextToken());
}

Arrays.sort(arr, (a, b) -> a[0] - b[0]);
PriorityQueue<Integer> pq = new PriorityQueue<>();
pq.offer(arr[0][1]);

for(int i = 1; i < N; i++) {
if(pq.peek() <= arr[i][0]) {
pq.poll();
}
pq.offer(arr[i][1]);
}
System.out.println(pq.size());
}
}
79 changes: 79 additions & 0 deletions 03월/2주차/[BOJ] 카우버거/Min.java
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

설명하실 때 말씀하신 것처럼 중복 부분을 메서드로 빼는 방법도 좋을 것 같아요!

Original file line number Diff line number Diff line change
@@ -0,0 +1,79 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Min {
private static PriorityQueue<Integer> burger;
private static PriorityQueue<Integer> side;
private static PriorityQueue<Integer> drink;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer str = new StringTokenizer(br.readLine());

int B = Integer.parseInt(str.nextToken());
int C = Integer.parseInt(str.nextToken());
int D = Integer.parseInt(str.nextToken());
int price = 0;

burger = new PriorityQueue<>(Collections.reverseOrder());
side = new PriorityQueue<>(Collections.reverseOrder());
drink = new PriorityQueue<>(Collections.reverseOrder());

str = new StringTokenizer(br.readLine());
for(int i = 0; i < B; i++) {
int b = Integer.parseInt(str.nextToken());
price += b;
burger.offer(b);
}

str = new StringTokenizer(br.readLine());
for(int i = 0; i < C; i++) {
int s = Integer.parseInt(str.nextToken());
price += s;
side.offer(s);
}

str = new StringTokenizer(br.readLine());
for(int i = 0; i < D; i++) {
int d = Integer.parseInt(str.nextToken());
price += d;
drink.offer(d);
}

System.out.println(price);
System.out.println(getSalePrice());
}

private static int getSalePrice() {
double sale = 0;
while(!burger.isEmpty() && !side.isEmpty() && !drink.isEmpty()) {
double b = burger.poll() * 0.9;
double s = side.poll() * 0.9;
double d = drink.poll() * 0.9;

sale += (b + s + d);
}

if(!burger.isEmpty()) {
while(!burger.isEmpty()) {
sale += burger.poll();
}
}
if(!side.isEmpty()) {
while(!side.isEmpty()) {
sale += side.poll();
}
}
if(!drink.isEmpty()) {
while(!drink.isEmpty()) {
sale += drink.poll();
}
}

return (int)sale;
}
}