C++编程 将10个不等长的字符串放在一个指针数组中,实现10个字符串的排序

用栈类模版写一个吧，再扩充一下功能，仅供参考！

#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <stdexcept>
#include <string>
using namespace std;

template <typename T>
class Stack
{
private:
vector<T> elems;
public:
void push(T const &);
void pop();
bool empty() const
{return elems.empty();}
void order();
};

template<typename T>
void Stack<T>::push(T const & elem)
{
elems.push_back(elem);
}

template<typename T>
void Stack<T>::pop()
{
if(elems.empty())
{
throw std::out_of_range("empty stack");
}
while(!elems.empty())
{
cout<<elems.back()<<"\t";
elems.pop_back();