35. LRU

 

입력 

 

5 9

1 2 3 2 6 2 3 5 7

 

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>

using namespace std;

int main()
{
	int size, n, value, i, j, pos;
	cin >> size >> n;

	vector<int> cache(n);

	for (i = 1; i <= n; ++i)
	{
		cin >> value;
		pos = -1;

		for (j = 0; j < size; ++j)
		{
			if (cache[j] == value)
			{
				pos = j;
			}
		}

		if (pos == -1)
		{
			for (j = size - 1; j >= 1; --j)
			{
				cache[j] = cache[j-1];
			}
		}
		else
		{
			for (j = pos; j >= 1; --j)
			{
				cache[j] = cache[j-1];
			}
		}

		cache[0] = value;
	}

	for (i = 0; i < size; ++i)
	{
		cout << cache[i] << " ";
	}

}