三行解决问题easy

惊不惊喜，意不意外

#include<bits/stdc++.h>
using namespace std;int n;double m;struct node{int k,s;}a[5005];bool cmp(node x,node y){return x.s>y.s;}struct node1{int kk,ss;}aa[5005];bool cmp1(node1 x,node1 y){if(x.ss!= y.ss)return x.ss>y.ss;else return x.kk<y.kk;}
int main(){cin>>n>>m;for(int i=1;i<=n;i++){cin>>a[i].k>>a[i].s;}sort(a+1,a+1+n,cmp);int mn=a[int(floor(m*1.5))].s;int j=0;for(int i=1;i<=n;i++){if(a[i].s>=mn){j++;aa[j].kk=a[i].k;aa[j].ss=a[i].s;}}cout<<mn<<" "<<j<<endl;sort(aa+1,aa+1+j,cmp1);for(int i=1;i<=j;i++){cout<<aa[i].kk<<" "<<aa[i].ss<<endl;}return 0;}