C++填充2个数组

我将介绍两个解决方案，一个没有高级C++，第二个将使用STL和structs
解决方案1(老派方式(：
不使用高级C++或STL的解决方案(代码中的注释将解释每个步骤(：

#include <iostream>
using namespace std;
// utility function to swap two elements
template<typename T>
void swap(T *xp, T *yp)   
{  
T temp = *xp;  
*xp = *yp;  
*yp = temp;  
}  
// we can do better sorting algorithm than this but its the simplest
void bubbleSort(double speeds[], string names[], int n)  
{  
for (int i = 0; i < n-1; i++) {
for (int j = 0; j < n-i-1; j++) {
if (speeds[j] < speeds[j+1]){ // if current elements is lower than the next one
swap(&speeds[j], &speeds[j+1]); // swap speeds 
swap(&names[j], &names[j+1]); // swap names
}
}
}
}  
int main()
{
int number;
cout << "How many do you have? ";
cin >> number;
string* names = new string[number];
double* speeds = new double[number];
cout << "Enter the names and speeds (name 'space' speed): " << endl;
for (int i = 0; i < number; i++)
{
cin >> names[i] >> speeds[i]; // here its i not number (number is out of range)
// this array goes from 0 to number - 1
}
bubbleSort(speeds, names, number); // call sorting algorithm O(n*n)
cout << "resutls = " << endl;
for (int i = 0; i < number; i++) // print resutls out
cout << "Name : " << names[i] << " Speed: " << speeds[i] << endl;
// free the memory we allocated from the heap (Never forget this)
delete[] names;
delete[] speeds;
return 0;
}

解决方案2(STL+结构(：
首先，由于名称和速度是耦合在一起的，您可能需要将它们放在
所谓的结构中，该结构是一个将您的(名称、速度(数据放在一起的包
还有其他选择，您可能希望使用std:：pair，但由于您希望稍后按升序对数据进行排序，我们将坚持使用结构并定义运算符<这将在以后用于排序。

// We pack our data inside one struct that contain the name and the speed
struct NameSpeed
{
string name;
double speed;
bool operator < (const NameSpeed& other) const // we need to define this operator for sorting
{
return (speed < other.speed); // sort based on speed field
}
};

现在，由于我们从用户那里获得的输入意味着在编译时没有定义数组的大小，我们可能需要使用动态内存
STL(C++标准库(提供std：：vector，它是动态分配的数组，并且能够调整大小，因此它比新操作符和删除操作符更灵活、更安全。

最后，这里是您需要的带有注释的代码，以澄清每个步骤：

#include <iostream>
#include <vector> // we need this for the vector class which is like an array
#include <algorithm> // we need this to sort the array later
using namespace std;
// We pack our data inside one struct that contain the name and the speed
struct NameSpeed
{
string name;
double speed;
bool operator < (const NameSpeed& other) const // we need to define this operator for sorting
{
return (speed < other.speed);
}
};
int main()
{
int i,number;
cout<<"How many do you have? ";
cin>> number;
vector<NameSpeed> items(number); // resize our array to have number as 
// size ( better than NameSpeed items[number]; 
// which is allocated on the stack and we need dynamic memory 
// and vector manage this for us)
cout<<"Enter the names and speeds (name 'space' speed): ";
cout<<endl;
// Please note that vector class have the operator[] 
// which allow us to use it just like a normal array
for (i = 0; i < number; i++) // iterate 
{
cin >> items[i].name >> items[i].speed; // get the data from the user name, speed respectively
}
cout<<endl;
sort(items.begin(), items.end()); // sort our array based on speed
for (const NameSpeed& ns : items) // Iterate through our array
cout << "Name :" << ns.name << "Speed :" << ns.speed << endl; // print name speed respectively
return 0;
}