delete pics to save space
This commit is contained in:
57
history_source/信息学奥赛一本通/2.2.8.cpp
Normal file
57
history_source/信息学奥赛一本通/2.2.8.cpp
Normal file
@ -0,0 +1,57 @@
|
||||
#include<iostream>
|
||||
#include<string>
|
||||
using namespace std;
|
||||
struct data
|
||||
{
|
||||
string ID;
|
||||
int age,h;
|
||||
};
|
||||
bool cmp(data a,data b)
|
||||
{
|
||||
if(a.age>=60)
|
||||
{
|
||||
if(b.age>=60)
|
||||
{
|
||||
if(a.age>b.age) return 1;
|
||||
if(a.age<b.age) return 0;
|
||||
return a.h<b.h;
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
if(b.age>=60) return 0;
|
||||
return a.h<b.h;
|
||||
}
|
||||
}
|
||||
template<class T>
|
||||
void fsort(T *left,T *right,bool (*cmp)(T a,T b),T *k)
|
||||
{
|
||||
if(right-left<=1) return;
|
||||
unsigned int len=right-left;
|
||||
fsort(left,left+len/2,cmp,k);
|
||||
fsort(left+len/2,right,cmp,k+len/2);
|
||||
int i=0,j=len/2,n=0;
|
||||
while(i<len/2&&j<len)
|
||||
{
|
||||
if(cmp(left[i],left[j])) k[n++]=left[i++];
|
||||
else k[n++]=left[j++];
|
||||
}
|
||||
while(i<len/2) k[n++]=left[i++];
|
||||
while(j<len) k[n++]=left[j++];
|
||||
for(int i=0;i<len;i++) left[i]=k[i];
|
||||
}
|
||||
int main()
|
||||
{
|
||||
int n;
|
||||
cin>>n;
|
||||
data p[n],k[n];
|
||||
for(int i=0;i<n;i++)
|
||||
{
|
||||
cin>>p[i].ID>>p[i].age;
|
||||
p[i].h=i;
|
||||
}
|
||||
fsort(p,p+n,cmp,k);
|
||||
for(int i=0;i<n;i++) cout<<p[i].ID<<endl;
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user