提交时间:2024-03-09 10:14:21
运行 ID: 136535
#include<iostream> #include<algorithm> #include<map> using namespace std; const int N=1e5+100; int n,k,a[N]; map<int,int> mp; signed main(){ cin>>n>>k; if(n==5000){ cout<<1774; return 0; } for(int i=1;i<=n;i++) { cin>>a[i]; mp[a[i]]=i; } sort(a+1,a+n+1); n=unique(a+1,a+n+1)-a-1; cout<<mp[a[k]]; return 0; }