本文共 1069 字，大约阅读时间需要 3 分钟。

专题博客链接

原题题目

#include 
   
    #include 
    
     #include 
     
      #include 
      
       using namespace std;template 
       
        struct Closer {
   // 在此处补充你的代码};int Distance1(int n1,int n2) {
   	return abs(n1-n2);}int Distance2(const string & s1, const string & s2){
   	return abs((int)s1.length()- (int) s2.length());}int a[10] = {
    0,3,1,4,7,9,20,8,10,15};string b[6] = {
   "American","Jack","To","Peking","abcdefghijklmnop","123456789"};int main(){
   	int n;string s;	while( cin >> n >> s ) {
   		sort(a,a+10,Closer
        
          (n,Distance1)); for(int i = 0;i < 10; ++i) cout << a[i] << "," ; cout << endl; sort(b,b+6,Closer
         
           (s,Distance2)); for(int i = 0;i < 6; ++i) cout << b[i] << "," ; cout << endl; } return 0;}
         
        
       
      
     
    
   

代码实现

private:    T1  n;    T2 func;public:    Closer(T1 n1,T2 func1):n(n1),func(func1){
   }    bool operator ()(const T1& n1,const T1 & n2)    {
           int judge1 = func(n1,n);        int judge2 = func(n2,n);        if(judge1 < judge2 || (judge1 == judge2 && n1 < n2)) return true;        else   return false;    }

转载地址：https://love6.blog.csdn.net/article/details/115026116 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！