洛谷P1068代码潘老师笔记 C++

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
//定义变量
int n, m, b[5005], s[5005];

int main()
{
	{
	//读入
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d", &b[i], &s[i]);
	}
	//2.排序
	for (int i = 1; i <= n; i++)
	{
		for (int j = i + 1; j <= n; j++)
		{
			if(s[j]>s[i]||(s[j]==s[i]&&b[j]<b[i]))
			{
				swap(b[j],b[i]);
				swap(s[i],s[j]);
			}
		}
	}
	//3.处理结果
	m = m * 1.5;
	printf("%d ", s[m]);
	int cnt = 0;
	//看m个人后面有多少个人分数等于分数线
	for (int i = 1; i <= n; i++)
	{
		if (s[i]>=s[m])
		{
			cnt++;
		}
	}
	printf("%d\n", cnt);
	for (int i = 1; i <= cnt; i++)
	{
		cout<<b[i]<<" "<<s[i]<<endl;
	}
	return 0;
}
}