Language: C++

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

int main(int argc, char const *argv[])
{

	std::vector<int> vec_num;
	int table[3];
	std::cin >> table[0] >> table[1] >> table[2];

	for (int i = 0;i < sizeof(table);i++) {
		vec_num.push_back(table[i]);
	}
	std::sort(vec_num.begin(), vec_num.end(), 
			[](const int* item1, const int* item2){
				return *item1 < *item2;
			});
	std::cout << vec_num[0] << " " << vec_num[1] << " " << vec_num[2] << std::endl;

	return 0;
}

Compiler output:
In file included from /usr/include/c++/14/bits/stl_algobase.h:71,
                 from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Iterator2 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = main(int, const char**)::<lambda(const int*, const int*)>]':
/usr/include/c++/14/bits/stl_algo.h:1777:14:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1777 |           if (__comp(__i, __first))
      |               ~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = main(int, const char**)::<lambda(const int*, const int*)>]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:15:11:   required from here
   15 |         std::sort(vec_num.begin(), vec_num.end(),
      |         ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   16 |                         [](const int* item1, const int* item2){
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   17 |                                 return *item1 < *item2;
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~
   18 |                         });
      |                         ~~
/usr/include/c++/14/bits/predefined_ops.h:158:30: error: no match for call to '(main(int, const char**)::<lambda(const int*, const int*)>) (int&, int&)'
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:158:30: note: candidate: 'bool (*)(const int*, const int*)' (conversion)
/usr/include/c++/14/bits/predefined_ops.h:158:30: note:   conversion of argument 3 would be ill-formed:
/usr/include/c++/14/bits/predefined_ops.h:158:30: error: invalid conversion from 'int' to 'const int*' [-fpermissive]
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
      |                              |
      |                              int
a.cc:16:25: note: candidate: 'main(int, const char**)::<lambda(const int*, const int*)>' (near match)
   16 |                         [](const int* item1, const int* item2){
      |                         ^
a.cc:16:25: note:   conversion of argument 2 would be ill-formed:
a.cc:16:25: error: invalid conversion from 'int' to 'const int*' [-fpermissive]
   16 |                         [](const int* item1, const int* item2){
      |                         ^
      |                         |
      |                         int
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = int; _Iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = main(int, const char**)::<lambda(const int*, const int*)>]':
/usr/include/c++/14/bits/stl_algo.h:1757:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1757 |       while (__comp(__val, __next))
      |              ~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1785:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1785 |             std::__unguarded_linear_insert(__i,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
 1786 |                                 __gnu_cxx::__ops::__val_comp_iter(__comp));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Compare = main(int, const char**)::<lambda(const int*, const int*)>]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:15:11:   required from here
   15 |         std::sort(vec_num.begin(), vec_num.end(),
      |         ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   16 |                         [](const int* item1, const int* item2){
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   17 |                                 return *item1 < *item2;
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~
   18 |                         });
      |                         ~~
/usr/include/c++/14/bits/predefined_ops.h:240:30: error: no match for call to '(main(int, const char**)::<lambda(const int*, const int*)>) (int&, int&)'
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:240:30: note: candidate: 'bool (*)(const int*, const int*)' (conversion)
/usr/include/c++/14/bits/predefined_ops.h:240:30: note:   conversion of argument 3 would be ill-formed:
/usr/include/c++/14/bits/predefined_ops.h:240:30: error: invalid conversion from 'int' to 'const int*' [-fpermissive]
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
      |                              |
      |                              int
a.cc:16:25: note: candidate: 'main(int, const char**)::<lambda(const int*, const int*)>' (near match)
   16 |                         [](const int* item1, const int* item2){
      |                         ^
a.cc:16:25: note:   conversion of argument 2 would be ill-formed:
a.cc:16:25: error: invalid conversion from 'int' to 'const int*' [-fpermissive]
   16 |                         [](const int* item1, const int* item2){
      |                         ^
      |                         |
      |                         int
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Value = int; _Compare = main(int, const char**)::<lambda(const int*, const int*)>]':
/usr/include/c++/14/bits/stl_heap.h:140:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main(int, const char**)::<lambda(const int*, const int*)> >]'
  140 |       while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
      |                                          ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:247:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main(int, const char**)::<lambda(const int*, const int*)> >]'
  247 |       std::__push_heap(__first, __holeIndex, __topIndex,
      |       ~~