最后一个点卡数组小于k和多组数据

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t,k;
    while(cin>>t>>k)
    {
        vector<int>a;
        while(t--)
        {
            char c;
            cin>>c;
            if(c=='I')
            {
                int b;
                cin>>b;
                a.push_back(b);
            }
            else if(c=='Q')
            {
                sort(a.begin(),a.end(),greater<int>());
                if((int)a.size()>=k)
                cout<<a[k-1]<<endl;
                else//数组小于k,输出最大的(隐藏条件)
                cout<<a[(int)a.size()-1]<<endl;
            }
        }
    }
    return 0;
}