sdut1595选夫婿2

#include
#include
#include
using namespace std;
struct E
{
    char name[27];
    int tall;
}s[1007];
int cmp(E a,E b)
{
        return a.tall=downt&&s[i].tall<=upt)
        {
            f++;
            printf("%s %d\n",s[i].name,s[i].tall);
        }
    }
    if(f==0)
    {
        printf("No\n");
    }
    return 0;
}


/***************************************************
User name: TJRAC6015203228魏杰
Result: Accepted
Take time: 0ms
Take Memory: 108KB
Submit time: 2016-10-31 22:07:55
****************************************************/

你可能感兴趣的:(sdut,ACM算法入门)