• 문제 링크
https://www.acmicpc.net/problem/13650
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
String s;
while ((s = br.readLine()) != null) {
int[] arr = new int[61];
int n = Integer.parseInt(s), cnt = 0;
while (n-- > 0) {
s = br.readLine();
int m = Integer.parseInt(s.substring(0, 2));
if (s.charAt(3) == 'D' ? arr[m]++ < 0 : arr[m]-- > 0) cnt++;
}
sb.append(cnt).append("\n");
}
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 10489 Even Up Solitaire - Data Structure / Java (0) | 2024.08.23 |
---|---|
[백준] 8538 Bałagan i Stonki - Data Structure / Java (0) | 2024.08.22 |
[백준] 22477 Kagisys - Data Structure / Java (0) | 2024.08.20 |
[백준] 12523 Twibet (Small), 12524 Twibet (Large) - Graph Theory / Java (0) | 2024.08.19 |
[백준] 28389 EGIPAT - Graph Theory / Java (0) | 2024.08.18 |
댓글