Huawei interview question: tall and short people queue up

subject

Now there is a group of children , They are different in height ,
We express the height of this group of children in an array of positive integers , Such as arrays {5,3,1,2,3}.
Now we want the children to line up , With “ high ”“ Short ”“ high ”“ Short ” Sequential arrangement ,
every last “ high ” The position of the children should be higher than the adjacent position or equal ;
every last “ Short ” The children in the position should be shorter than or equal to the adjacent position ;
Ask the children to move at a minimum distance , The first one from “ high ” Start to line up , Output the minimum moving distance .
for example , In the demonstration team {5,3,1,2,3} in ,{5, 1, 3, 2, 3} It's the sorting result .
{5, 2, 3, 1, 3} Although also satisfied “ high ”“ Short ”“ high ”“ Short ” Sequential arrangement ,
But children move a lot , So it's not the best result .
The definition of moving distance is as follows ：
The second child moves behind the third child , The moving distance is 1,
If you move behind the fourth child , The moving distance is 2;

Input description :
Children in front of the order , Positive integer with English space ：
4 3 5 7 8
notes ： Children <100 individual
Output description :
The sorted children , A positive integer divided by English spaces ：
4 3 7 5 8
remarks ：4（ high ）3（ Short ）7（ high ）5（ Short ）8（ high ）,
The output result is the minimum moving distance , Only 5 and 7 Changed places , The moving distance is 1.

Example 1 ：

Input

4 1 3 5 2

Output

4 1 5 2 3

Example 2 ：

Input

 1 1 1 1 1

Output

 1 1 1 1 1

explain ： Adjacent positions can be equal

Example 3 ：

Input ：

 xxx

Output

 []

explain ： Illegal parameter condition occurs , Return an empty array

Code ：

#include<iostream>
#include<vector>
using namespace std;
int main(){
    
    vector<int> cap;
    int tmp;
    while(cin >> tmp){
    
        cap.push_back(tmp);
        char c = cin.get();
        if(c == '\n') break;
        if(c != ' '){
    
            cout << endl;
            return 0;
        }
    }
    int len = cap.size();
    for(int i = 0; i < len; ++i){
    
        if(i % 2 == 0 && i < len - 1 && cap[i] < cap[i + 1]) swap(cap[i],cap[i + 1]);
        if(i % 2 == 1 && i < len - 1 && cap[i] > cap[i + 1]) swap(cap[i],cap[i + 1]);
        i != 0 && cout << " ";
        cout << cap[i];
    }
    cout << endl;
    return 0;
}