蓝桥杯:P1102

#include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
using namespace std;
struct prut
{
    string name;
    string mc;
    int age;
    int sorce;
};
int main()
{
    int n;
    cin>>n;
    vector<prut> k(n);
    for(int i=0;i<n;i++)
        cin>>k[i].name>>k[i].mc>>k[i].age>>k[i].sorce;
    for(int i=0;i<n-1;i++)
        for(int j=0;j<n-1;j++)
        {
            if(k[j].sorce>k[j+1].sorce)
            {
                k[j].sorce ^= k[j+1].sorce ^= k[j].sorce ^= k[j+1].sorce;
            
                k[j].age ^= k[j+1].age ^= k[j].age ^= k[j+1].age;
               

                k[j].name.swap(k[j+1].name);
                k[j].mc.swap(k[j+1].mc);
            }
        }
    for(int i=0;i<n;i++)
        cout<<k[i].name<<" "<<k[i].mc<<" "<<k[i].age<<" "<<k[i].sorce<<endl;
}

猜你喜欢

转载自blog.csdn.net/m0_43382549/article/details/88984277
今日推荐