| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 109261 | 梁颢城 | 第k小数1 | C++ | Wrong Answer | 90 | 12 MS | 1036 KB | 313 | 2023-11-08 13:13:13 |
#include<bits/stdc++.h> using namespace std; int a[1000010]; int b[1000010]; int main(){ int n,k; scanf("%d",&n); scanf("%d",&k); for(int i = 0;i < n;i++){ scanf("%d",&a[i]); b[i] = a[i]; } sort(a,a+n); for(int j = 0;j < n;j++){ if(b[j] == a[k-1]){ printf("%d",j+1); } } }