pat stack模拟，老超时wa......

#include <stack>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
using namespace std;
class st
{
private:
vector<int> vec;
public:
st(){};
~st(){};
void pop()
{
if (vec.size() == 0)
{
printf("%s\n", "Invalid");
}
else
{
printf("%d\n", vec.back());
vec.pop_back();
}
}
void push(int val)
{
printf("%d\n", val);
vec.push_back(val);
}
void partition(vector<int> &vec, int& k)//k为划分元素的位置
{
int high = vec.size() - 1;
int low = 0;
int i = low, j = high;
int val = vec[0];
while (i<j)
{
while (j>i&&vec[j] >= val)
{
j--;
}
if (i<j)
vec[i++] = vec[j];
while (j>i&&vec[i] <= val)
{
i++;
}
if (i<j)
vec[j--] = vec[i];
}
vec[i] = val;
k = i;
}
int find(int left, int right, int rank, vector<int>& vec)//找第k大的元素
{
int index = -1;
int t = 0;
if (right>left)
{
partition(vec, t);
int len = t - left + 1;//表示第几个数
if (len == rank)
index = t;
else if (len < rank)
{
index = find(t + 1, right, rank - len, vec);
}
else
{
index = find(left, t - 1, rank, vec);
}
}
return index;
}
int findmidlle()
{
int size = vec.size();
stack<int> tempst;
if (size == 0)
{
printf("%s\n", "Invalid");
return -1;
}
int pos = 0;
if (size % 2)
pos = find(0, size - 1, (size - 1) / 2, vec);
else
{
pos = find(0, size - 1, (size) / 2, vec);
}
cout << vec[pos] << endl;
return pos;
}
};
int main()
{
int num = 0;
std::ios::sync_with_stdio(false);
scanf("%d", &num);
//string com = "";
char com[100];
st solu;
while (num--)
{
scanf("%s", com);
if (com[1]=='0')
{
solu.pop();
}
else if (com[1]=='u')
{
int val;
scanf("%d", &val);
solu.push(val);
}
else
{
solu.findmidlle();
}
}
return 0;
}