提交时间:2024-03-05 17:09:18
运行 ID: 135466
#include<bits/stdc++.h> using namespace std; int n,k; struct a { int shu; int wei; }a[100005],b[100005]; void pai(int l,int r) { if(l==r)return; int mid=(l+r)/2; pai(l,mid); pai(mid+1,r); int i=l,j=mid+1,f=l; while(i<=mid&&j<=r) { if(a[i].shu<=a[j].shu) b[f++]=a[i++]; else b[f++]=a[j++]; } if(i<=mid) while(i<=mid)b[f++]=a[i++]; if(j<=r) while(j<=r)b[f++]=a[j++]; for(i=l;i<=r;i++)a[i]=b[i]; } int main() { cin>>n>>k; for(int i=1;i<=n;i++) { cin>>a[i].shu; a[i].wei=i; } pai(1,n); cout<<a[k].wei; return 0; }