1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n,m,b[105],bi,ans; struct sut{ int hao,ji; }a[105]; int main() { cin>>n>>m;a[m].hao=1; for(int i=0;i<n;i++) { cin>>a[i].ji; b[i]=a[i].ji; } sort(b,b+n);bi=n-1; for(int i=0;;i++) { if(i==n) i=0; if(a[i].ji!=-1) { if(a[i].ji==b[bi]) { ans++;a[i].ji=-1;bi--; if(a[i].hao==1) {cout<<ans;return 0;} } } } return 0; }
- 1
Information
- ID
- 964
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By