Using the map STL

I have a homework problem dealing with coding the 0-1 knapsack problem greedily and dynamically. I am to use the map STL for the dynamic implimentation, but am not familiar with it. I am looking for a good reference for using it, preferably showing it used to hold set information. I have found
C++ Reference which shows the various methods of the class, but I would like more to go on before I dive in.

Any help is appreciated, and I will try to answer any requests for more information.

Also, the meat of the the assignment is analysis of the algoritms: running times, differences, effectiveness, and such. The instrustor said it was fine getting help with implimentation issues.

Seth.

http://www.devhood.com/tutorials/tut...utorial_id=379

Just search google for

STL Map Tutorial

This was the first link, I'm sure others are better.

Thanks. Guess I need to get better at formatting google searches. I looked for "c++ stl map using" and it returned a lot of message board posts.

Thanks again, the tutorial you pointed to answered my questions.

Seth