KBODRAFT

https://www.algospot.com/judge/problem/read/KBODRAFT

algospot.com :: KBODRAFT

[ 입력 -> 삭제 -> 삽입 -> 결과 ]의 반복임.

using namespace std;

struct CARD{
	CARD(int _index, int _power)
	{
		index = _index;
		power = _power;
	}
	int index;
	int power;
};

list PLAYER[9];
int PLAYERPOINT[9];

int findIndex(int index)
{
	if (PLAYER[index].size() > 0)
	{
		int BIGPOWER = -9999;
		list< CARD >::iterator iterEnd = PLAYER[index].end();
		for (list< CARD >::iterator iterPos = PLAYER[index].begin();
			iterPos != iterEnd;
			++iterPos)
		{
			BIGPOWER = (BIGPOWER < iterPos->power) ? iterPos->power : BIGPOWER;
		}
		return BIGPOWER;
	}
	else
		return 0;
}
int Add(int index, int score)
{
	if (score <= PLAYERPOINT[index])
		return 0;
	else
		PLAYERPOINT[index] = score;

	int OUTPUT = 0;
	for (int i = 0; i < 9; i++)
		if (PLAYERPOINT[i] == 0)
			return 0;
		else
			OUTPUT += PLAYERPOINT[i];

	return OUTPUT;
}
void Delete(int index)
{
	for (int i = 0; i < 9; i++){
		if (PLAYER[i].size() > 0)
		{
			CARD _CARD = PLAYER[i].front();
			if (_CARD.index == index)
			{
				PLAYER[i].pop_front();

				if (_CARD.power == PLAYERPOINT[i])
					PLAYERPOINT[i] = findIndex(i);
			}
		}
	}
}
int main()
{
	int CASE;
	for (scanf("%d", &CASE); CASE > 0; CASE--)
	{
		int N, K, OUTPUT = 0;

		memset(PLAYERPOINT, 0, sizeof(PLAYERPOINT));
		for (int i = 0; i < 9; i++)
			PLAYER[i].clear();

		scanf("%d %d", &N, &K);

		for (int i = 0; i < N; i++)
		{
			int P, A;
			scanf("%d %d", &P, &A);
			CARD _CARD(i, A);
			
			if (i + 1 > K)
				Delete(i - K);
			
			PLAYER[P - 1].push_back(_CARD);
			int output = Add(P - 1, A);
			
			OUTPUT = (OUTPUT < output) ? output : OUTPUT;

		}
		printf("%d\n", OUTPUT);
	}

	return 0;
}