/*
*Copyright (c) 2014 ,烟台大学计算机学院
*All right reserved.
*文件名称:带姓名的成绩单.cpp
*作 者:王伟诚
*完成日期:2014年11月29日
*版 本 号:1.0
*
*问题描述:每名同学的姓名与成绩的下标要始终保持一致,输出按成绩排序后的同学的名单
*问题输出:输出按成绩排序后的同学的名单
*/
#include <iostream>
#include <string>
using namespace std;
int main()
{
int k,i,j,t;
double score[8]= {86,77,95,43,67,88,91,69};
string name[8]= {"zhao","qian","sun","li","zhou","wu","zheng","wang"},r;
for(i=0; i<=7; i++)
{
k=i;
for(j=i+1; j<8; j++)
if(score[j]<score[k] )k=j;
t=score[k];
score[k]=score[i];
score[i]=t;
r=name[k];
name[k]=name[i];
name[i]=r;
}
int n;
for(n=0; n<=7; n++)
cout<<name[n]<<" "<<score[n]<<endl;
return 0;
}
输出按同学姓名排序后的成绩单
#include <iostream>
#include <string>
using namespace std;
int main()
{
int k,i,j,t;
double score[8]= {86,77,95,43,67,88,91,69};
string name[8]= {"zhao","qian","sun","li","zhou","wu","zheng","wang"},r;
for(i=0; i<=7; i++)
{
k=i;
for(j=i+1; j<8; j++)
if(name[j]<name[k] )k=j;
t=score[k];
score[k]=score[i];
score[i]=t;
r=name[k];
name[k]=name[i];
name[i]=r;
}
int n;
for(n=0; n<=7; n++)
cout<<name[n]<<" "<<score[n]<<endl;
return 0;
}
让数组中的数据由f1.txt提供
#include<iostream>
#include<string>
#include<fstream>
#include<cstdlib>
using namespace std;
int main()
{
int i=0, j, t;
string temp;
string name[8] =
{ "zhao", "qian", "sun", "li", "zhou", "wu", "zheng", "wang" };
double score[8];
ifstream infile("f1.dat",ios::in);
if (!infile)
{
cerr<<"没有找到文件!"<<endl;
exit (1);
}
while (i<8)
{
infile>>score[i];
i++;
}
infile.close();
for (j = 1; j <=7; j++)
for (i = 0; i < 8 - j; i++)
if (score[i] < score[i + 1])
{
t = score[i];
temp = name[i];
score[i] = score[i + 1];
name[i] = name[i + 1];
score[i + 1] = t;
name[i + 1] = temp;
}
cout << "按成绩排序后输出的结果为:" << endl;
for (i = 0; i < 8; i++)
cout << name[i] << ":" << score[i] << endl;
for (j = 1; j <= 7; j++)
for (i = 0; i < 8- j; i++)
if (name[i] > name[i + 1])
{
t = score[i];
temp = name[i];
score[i] = score[i + 1];
name[i] = name[i + 1];
score[i + 1] = t;
name[i + 1] = temp;
}
cout << "按姓名排序后输出的结果为:" << endl;
for (i = 0; i <8; i++)
cout << name[i] << ":" << score[i] << endl;
return 0;}