Mouse Pursuit

면접 대비

시간 제한3초메모리 제한2048 MB

요약

몇 초 전에 일어났는지로 시간이 주어진 사건들에서 최근 k초 안에 속하는 사건의 치즈와 영광 획득량을 부호까지 반영해 각각 합산한다.

난이도: 쉬움10점 중 3점
유형: 배열, 정렬, 누적 합, 구현
정답자: 아직 제출이 없습니다

문제

Brandon is playing the newest idle game, Mouse Pursuit! The goal of this game is to pursue mice for cheese and glory.

In Mouse Pursuit, an event consists of pursuing a mouse. If the mouse is caught, the player might earn cheese and glory. However, if the mouse is not caught, the player might lose cheese and glory.

Given Brandon's recent events, Brandon wants to know how much cheese and glory he earned in the last $k$ seconds.

입력

The first line of input contains a single integer, $n$ $(1 \le n \le 10^5)$ .

The next $n$ lines take one of two forms:

$\text{CAUGHT}$ $s$ $c$ $g$ : A mouse was caught exactly $s$ seconds ago. The player gained $c$ pieces of cheese and $g$ units of glory.
$\text{MISS}$ $s$ $c$ $g$ : A mouse was missed exactly $s$ seconds ago. The player lost $c$ pieces of cheese and $g$ units of glory.

For all events, $0 \le c, g \le 10^6$ and $1 \le s \le 10^9$ . It is guaranteed that no two events happened at exactly the same time.

The last line contains a single integer $k$ . It is guaranteed that no event happened exactly $k$ seconds ago.

출력

Output two integers - the number of pieces of cheese Brandon gained in the last $k$ seconds, and the number of units of glory Brandon gained in the last $k$ seconds.

예제1

예제 1

입력

3
CAUGHT 1 6 5
MISS 4 1 2
CAUGHT 8 0 3
5

예상 출력

5 3