Accelerated C++ Exercise 3-4 Solution Question

I'm in the process of working my way through Accelerated C++, so far
I'm finding the book to be an excellent read. Thanks for the
suggestion in the FAQ.

Since I know that I will be working with string data in some programs
I want to write, I decided to tackle exercise 3-4, which asks to write
a program that will report the longest and shortest string that the
program receives.

My solution is below. The program works, but I'd like to hear
people's thoughts on it and hear about different approaches. How else
would you approach the problem below?

I have programmed in C before, and I'm trying to avoid using a C
solution below. I really want to learn what C++ has to offer and
utilize it.

Thanks,

Brian

Note: The book has not introduced functions yet, so I am not using any
in my solution. Also, the book hasn't introduced program
organization, so I have not organized my data away from the calcs and
function calls. And I'm not doing any function error checking below
either.

#include <iostream>
#include <string>
#include <vector>

using std::cout;
using std::cin;
using std::endl;
using std::vector;
using std::string;
using std::sort;

int
main() {

    vector<string> sVec;
    vector<int> iVec;
    string x;

    // sVec contains all the strings
    while (cin >> x)
        sVec.push_back(x);

    // check vector string size
    vector<string>::size_type vectorsize;
    vectorsize = sVec.size();

    // string::size_type stringsize;
         for (unsigned int i = 0; i < vectorsize; ++i) {
        iVec.push_back(sVec[i].size());
    }

    // check vector integer size
    vector<int>::size_type iVectorsize;
         iVectorsize = iVec.size();

         sort(iVec.begin(), iVec.end());
         cout << "min: " << iVec[0] << endl
         << "max: " << iVec[iVectorsize-1] << endl;

    return 0;
}

--
      [ See http://www.gotw.ca/resources/clcm.htm for info about ]
      [ comp.lang.c++.moderated. First time posters: Do this! ]