提交时间:2024-03-09 10:27:40

运行 ID: 136549

#include <iostream> #include <algorithm> using namespace std; struct number { int num, id; }a[1000100]; bool cmp(number x, number y) {return x.num < y.num;} int main() { int n, k; cin >> n >> k; for(int i = 1; i <= n; i++) {cin >> a[i].num; a[i].id = i;} sort(a + 1, a + n + 1, cmp); cout << a[k].id << endl; return 0; }