[백준/2752번/C++] 세수정렬

• 문제

 

 

• 답안

- vector, sort를 쓴 경우

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

using namespace std;

vector<int> arr;
int input;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	for (int i = 0; i < 3; i++)
	{
		cin >> input;
		arr.push_back(input);
	}

	sort(arr.begin(), arr.end());

	for (int i = 0; i < 3; i++)
	{
		cout << arr[i] << ' ';
	}


	return 0;
}

 

 

- swap으로 직접 정렬

#include <iostream>
using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int arr[3] = { 0, };

	for (int i = 0; i < 3; i++)
	{
		cin >> arr[i];
	}

	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 2; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}

	for (int i = 0; i < 3; i++)
	{
		cout << arr[i] << ' ';
	}

	return 0;
}