http://47.96.116.66/problem.php?cid=1177&pid=7

http://47.96.116.66/problem.php?cid=1180&pid=7

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{
    int id,s,d;
}e[N];
bool cmp(node a,node b){
    if(a.s==b.s){
        if(a.d==b.d){
            return a.id<b.id;
        }
        return a.d>b.d;
    }
    return a.s>b.s;
}

int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        e[i].id=i;
        scanf("%d%d",&e[i].s,&e[i].d);
    }
    sort(e+1,e+n+1,cmp);
    scanf("%d",&k);
    for(int i=1;i<=k;i++){
        cout<<e[i].id<<" "<<e[i].s<<" "<<e[i].d<<" "<<i<<endl;
    }
    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}