sort函數與結構體

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
struct student
{
    float score;
    int id;
}a[101];
int comp(const student &a,const student &b)
{
    return a.score>b.score;//降序排列
}
int comp(const student &a,const student &b)
{
    if(a.score==b.score)
        return a.id>b.id;//如果score相同，ID降序排
     else
        return a.score>b.score;
 }
 //或
 int comp(const student &a, const student &b)
 {
     if(a.score>b.score)
         return true;
     if(a.score==b.score)
         return a.id>b.id;
      return false;//*****這句容易忘
 }
int main()
{
    int n,k;
    cin>>n>>k;
    for (int i=1;i<=n;++i)      
        cin>>a[i].id>>a[i].score;
    sort(a+1,a+n+1,comp);
    cout<<a[k].id<<' '<<a[k].score<<endl;
    return 0;

這篇寫的更好