UVA - 1346 Songs （贪心+排序）

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#define lowbit(x) (x & (-x))
const double eps = 1e-8;
inline int dcmp(double a, double b){
    if(fabs(a - b) < eps) return 0;
    return a > b ? 1 : -1;
}
typedef long long LL;
typedef unsigned long long ULL;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const LL LL_INF = 0x3f3f3f3f3f3f3f3f;
const LL LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const int MOD = 1e9 + 7;
const double pi = acos(-1.0);
const int MAXN = 70000 + 10;
const int MAXT = 10000 + 10;
using namespace std;
struct Node{
    int id, len;
    double f;
    double k;
    void read(){
        scanf("%d%d%lf", &id, &len, &f);
        k = len / f;
    }
    bool operator < (const Node&rhs)const{
        return k < rhs.k;
    }
}num[MAXN];
int main(){
    int n;
    while(scanf("%d", &n) == 1){
        for(int i = 1; i <= n; ++i){
            num[i].read();
        }
        sort(num + 1, num + 1 + n);
        int t;
        scanf("%d", &t);
        printf("%d\n", num[t].id);
    }
    return 0;
}