一直都是九十分

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,x,sum,ans;
struct stu{
	int id,sc;
}a[N];
bool cmp(stu a,stu b){
	if(a.sc!=b.sc)return a.sc>b.sc;
	else return a.id<b.id;
}
int main(){
	cin>>n>>x;
	for(int i=1;i<=n;i++){
		cin>>a[i].sc;
		a[i].id = i;
	}
	sum = a[x].sc;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)cout<<a[i].id<<" ";
	for(int i=1;i<=n;i++){
		if(a[i].sc==sum){
			cout<<endl<<i;
			break;
		}
	}
	return 0;
}