코딩테스트 백준 - 10816 숫자 카드 2

#include <stdio.h>

#include <iostream>
#include <vector>

using namespace std;

typedef long long LL;

void MergeSort(vector<LL>& v, int left, int mid, int right)
{
	int i = left, j = mid + 1;
	int k = 0;
	vector<int> temp(right - left + 1);
	while (i <= mid && j <= right)
	{
		if (v[i] <= v[j])
		{
			temp[k] = v[i];
			i++;
		}
		else
		{
			temp[k] = v[j];
			j++;
		}
		k++;
	}

	while (i <= mid)
	{
		temp[k] = v[i];
		i++;
		k++;
	}

	while (j <= right)
	{
		temp[k] = v[j];
		j++;
		k++;
	}

	k--;
	while (k >= 0)
	{
		v[left + k] = temp[k];
		k--;
	}
}

void MergeSort(vector<LL>& v, int start, int end)
{
	if (start < end)
	{
		int mid = (start + end) / 2;

		MergeSort(v, start, mid);
		MergeSort(v, mid + 1, end);

		MergeSort(v, start, mid, end);
	}
}

int LowerBound(vector<LL>& card, int targetCard)
{
	int left = 0, right = card.size() - 1;

	while (right > left)
	{
		int mid = (left + right) / 2;

		if (card[mid] >= targetCard)
		{
			right = mid;
		}

		else
		{
			left = mid + 1;
		}
	}
	return right;
}

int UpperBound(vector<LL>& card, LL targetCard)
{
	int left = 0, right = card.size() - 1;

	while (right > left)
	{
		int mid = (left + right) / 2;

		if (card[mid] > targetCard)
		{
			right = mid;
		}

		else
		{
			left = mid + 1;
		}
	}
	return right;
}

int main()
{
	int N;
	cin >> N;

	vector<LL> card(N);
	for (int i = 0; i < N; i++)
	{
		cin >> card[i];
	}

	MergeSort(card, 0, card.size() - 1);

	int M;
	cin >> M;

	vector<int> results(M);
	for (int i = 0; i < M; i++)
	{
		LL target;
		cin >> target;

		int lower = LowerBound(card, target);
		int upper = UpperBound(card, target);
		int result = upper - lower;

		if (upper == card.size() - 1 && card[card.size() - 1] == target) { result++; }

		results[i] = result;
	}

	for (int i = 0; i < M; i++)
	{
		printf("%d\n", results[i]);
	}
}

if (upper == card.size() - 1 && card[card.size() - 1] == target) { result++; }