Codeforces Solution 158A Next Round

Solve in C++:

#include<bits/stdc++.h>
using namespace std;
int main()
{
 int n[100],k,nn,i,j,c=0;
 while(cin>>nn>>k)
 {
  for(i=0;i<nn;i++)
  {
      cin>>n[i];
  }
  for(i=0;i<nn;i++)
  {
      if(n[i]>=n[k-1]&&n[i]>0)
        c++;
  }
  cout<<c<<endl;
  c=0;
 }


}

No comments

Most View Post

Recent post

RESTful APIs with CRUD Operations in Laravel 12| (2025)

  RESTful APIs serve as the foundation of modern web development. They follow a set of rules called Representational State Transfer (REST) t...

Powered by Blogger.