我的C ++程序无法正常工作……只是陷入其中，不知道该怎么办

Question

I wanted to take the values from user and wanted to sort it... so i took values in two arrays one in string array and the other in int array... if i sort the string array it get sorted very well.. im not able to sort the int array accordingly.... but its still not working ...i hope u guys can help

so i searched net and tried using the pair function from STL

void sortItems(char array[][10],int y[],int n){
    pair<char,int>pairt[n];
    for (int i = 0; i < n; i++)  
    { 
        pairt[i].first = array[i][10]; 
        pairt[i].second = y[i]; 
    } 
    char t[20];
    int i,j,k,p=1;

    for(i=1; i<=n; i++)
    {
        for(j=1; j<11; j++)
        {
            if(strcmp(pairt[j-1], pairt[j])>0)
            {
                strcpy(t, pairt[j-1]);                          
                strcpy(pairt[j-1], pairt[j]);               
                strcpy(pairt[j], t);
                p=i;
            }
        }
    }
    std::cout<<"Dokemon in alphabetical order : \n";
    for(i=1; i<=n; i++)
    {
        std::cout<<array[i]<<endl;
    }
}

[Error] cannot convert 'std::pair' to 'const char*' for argument '1' to 'int strcmp(const char*, const char*)'

m getting 4 errors of this type

Answer 1

Here is a full solution. I used ad-hoc vectors of strings and numbers, but you can pass them as arguments. The following code uses C++11 features:

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

using namespace std;

#include <algorithm>

void main()
{
    auto nums = vector < int > {1, 2, 3, 4, 5};
    auto words = vector < string > {"hello", "world", "apples", "oranges", "bananas"}; 

    // collect into pairs
    using MyPair = pair<string, int>;
    vector<MyPair> pairs;
    for (size_t i = 0; i < nums.size(); i++) pairs.push_back(make_pair(words[i], nums[i]));

    // sort in place the pairs according to the words 
    std::sort(pairs.begin(), pairs.end(), [](MyPair p1, MyPair p2) {return p1.first < p2.first; });

    // re-write original vectors
    for (size_t i = 0; i < nums.size(); i++) {
        nums[i] = pairs[i].second;
        words[i] = pairs[i].first;
    }

    // now print and check
    for (size_t i = 0; i < nums.size(); i++) {
        cout << words[i] << ", " << nums[i] << endl;
    }
}

First I create the two vectors. Next I collect them into pairs. For this I use an alias for a pair, since I will need it later in a lambda-function sorting, and I don't want the full pair<...> text, it's too long (as you can see I like short code and I also don't use qualified namespace, except for the algorithm library). Also, I should have used const pair & in the anonymous function, but again, in this situation I give more weight to short code.

(BTW, C++14 would even let you use auto p1, auto p2 . But I used Visual Studio 2013 which didn't support it (that's why I could declare main() as void . g++ wouldn't let you get away with this...))

Then comes the sorting function, with a lambda (or anonymous) function that compares between the strings of each 2 pairs.

Eventually I split the pairs back to two vectors. I hope this gives a better understanding of the method of sorting pairs, and in general, using C++.