#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int arr[] = {0, 2, 1, -3, -5, 3, 1, 2}; //8 elements
	int *min_pointer = std::min_element(arr, arr+8);
	if (min_pointer == arr+8) return 0;
	
	std::sort(min_pointer, arr+8);
	
	for (int i=0; i!=8; i++)
		cout<<arr[i]<<endl;
	
	return 0;
}