1. #include<bits/stdc++.h> #include #include #include<string.h> #include<stdio.h> #include #include #include<math.h> #include #include #include #include #include using namespace std; #define LL long long using namespace std; const int N = 100000 + 10; const int INF = 0x3f3f3f3f; int n , m , cnt , k; struct node { int id; int sum; }a [N];

bool cmp (node a1 , node a2) { if (a1.sum == a2.sum) return a1.id < a2.id; return a1.sum > a2.sum; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a [i].sum; a [i].id = i; } sort (a + 1 , a + n + 1 , cmp); for (int i = 1 ;i <= n; i++) { cout << a [i].id << " "; } cout << "\n"; for (int i = 1; i <= n; i++) { if (a [i].id == m) break; if(a [i - 1].sum != a [i].sum) { cnt += k; k = 1; } else k++; } cout << ++cnt; return 0; }