[백준] 17952 과제는 끝나지 않아! - Java

 

 

 

스택 자료구조를 사용해 하라는 대로 구현하면 풀 수 있는 문제이다.

 

 

import java.util.*;
import java.io.*;

public class Main {

	static long arr_koong[] = new long[68];

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

		int N = Integer.parseInt(br.readLine());

		Stack<Assignment> stack = new Stack<>();

		StringTokenizer st;

		int ans = 0;

		for (int i = 0; i < N; i++) {
			st = new StringTokenizer(br.readLine());

			int cmd = Integer.parseInt(st.nextToken());

			if (cmd == 0) {

			}

			if (cmd == 1) {
				int A = Integer.parseInt(st.nextToken());
				int T = Integer.parseInt(st.nextToken());

				stack.push(new Assignment(A, T));

			}
			if (!stack.isEmpty()) {
				stack.peek().time--;

				if (stack.peek().time == 0) {
					ans = ans + stack.peek().score;
					stack.pop();
				}
			}

		}

		System.out.println(ans);

	}
}

class Assignment {
	int score = 0;
	int time = 0;

	Assignment(int a, int b) {
		score = a;
		time = b;
	}
}