【NOIP2009】【Luogu1068】分数线划定

problem

solution

codes

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
const int maxn = 5050;
struct node{ int id, score; }a[maxn];
int cmp(node a, node b){
     if(a.score != b.score)return a.score>b.score;
     return a.id<b.id;
 }
int main(){
    int n, m;  cin>>n>>m;  m=m*1.5;
    for(int i = 1; i <= n; i++)
        cin>>a[i].id>>a[i].score;
    sort(a+1,a+n+1,cmp);
    for(int i = m+1; i <= n; i++)
        if(a[i].score==a[m].score)m++;
    cout<<a[m].score<<" "<<m<<"\n";
    for(int i = 1; i <= m; i++)
        cout<<a[i].id<<" "<<a[i].score<<"\n";
    return 0;
}
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80433168