rqnoj-517

#include<stdio.h>#include<algorithm>#include<iostream>using namespace std;struct node{    int s,k;}s[5005];bool cmp(node a,node b){    if(a.s!=b.s)        return a.s>b.s;    if(a.k!=b.k)        return a.k<b.k;}int main(){    //freopen("d:\\test.txt","r",stdin);    int n,m,i,v;    scanf("%d%d",&n,&m);    for(i=1;i<=n;++i)        scanf("%d%d",&s[i].k,&s[i].s);    sort(s+1,s+n+1,cmp);    m=m*3/2;    v=s[m].s;    while(s[m+1].s==v && m<=n)        ++m;    printf("%d %d\n",s[m].s,m);    for(i=1;i<=m;++i)        printf("%d %d\n",s[i].k,s[i].s);    return 0;}