URI 1244 Sort by Length

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int tes;
   cin >> tes;
    getchar();
   while(tes--)
   {
       string s , s2 , s3 , s4;
       getline(cin , s);

       vector < string > vs;
       vector <pair<int , string>> vc;
       vector <int> vk;
       map < int , string> mp;
       map <int , string> :: iterator it;

       for(int i = s.length() - 1; i >= 0; i--)
       {
           if(s[i] == ' ')
            break;
           else
           s3 += s[i];
       }
       for(int i = 0; i < s.length(); i++)
       {
            if(s[i] != ' ')
           s2+= s[i];
           if(s[i] == ' ' || s[i] == '\n')
           {
               vs.push_back(s2);
               s2.clear();
           }
       }
      for(int i = s3.length() - 1; i >= 0; i--)
      {
          s4 += s3[i];
      }

      vs.push_back(s4);
       int k ;
      for(int i = 0; i < vs.size(); i++)
      {
          k = vs[i].length();
        vk.push_back(k);
      }

      for(int i = vk.size() - 1; i >= 0; i--)
      {
          for(int j = 0; j < i; j++)
          {
              if(vk[j] < vk[j + 1])
              {
                  swap(vk[j] , vk[j + 1]);
                  swap(vs[j] , vs[j + 1]);
              }
          }
      }

      for(int i = 0; i < vk.size() - 1; i++)
      {
          cout<<vs[i]<<" ";
      }
      cout<<vs[vk.size() - 1]<<endl;
      vs.clear();
      vk.clear();

   }

}