Answer to Question #79818 in C++ for Parker James

Question

The following code defines a multimap associative container and inserts some initial values. Add code for a second multimap associative container and algorithm statements that search for duplicates in the original container and move those duplicate keys and values to the new container (deleting the entries from the original container).

#include <map>
using namespace std;

int main()
{
multimap< int, int, less< int > > container8;

container8.insert( make_pair ( 7, 24 ) );
container8.insert( make_pair ( 7, 16 ) );
container8.insert( make_pair ( 4, 56 ) );
container8.insert( make_pair ( 4, 72 ) );
container8.insert( make_pair ( 3, 17 ) );
container8.insert( make_pair ( 7, 41 ) );
container8.insert( make_pair ( 2, 12 ) );
container8.insert( make_pair ( 5, 67 ) );
}

Answer 1

Dear Parker James, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order