fork(3) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28. void TC(){
  29. 	int n, k; cin>>n>>k;
  30. 	int a[n];
  31. 	int cnt = 0;
  32. 	for(int i = 0; i < n ; i++){
  33. 		cin>>a[i];
  34. 		if(a[i] <= k) ++cnt;
  35. 	}
  36. 	int res = 0, dem = 0;
  37. 	for(int i = 0; i < cnt; i++){
  38. 		if(a[i] <= k) ++dem;
  39. 	}
  40. 	res = dem;
  41. 	for(int i = 1 ; i <= n-cnt; i++){
  42. 		if(a[i-1]<=k) --dem;
  43. 		if(a[i+cnt-1] <=k) ++dem;
  44. 		res = max(res, dem);
  45. 	}
  46. 	cout<<cnt-res<<endl;
  47. }
  48.  
  49. int main(){
  50. 	//freopen("input.txt","r", stdin);
  51. 	//freopen("output.txt","w",stdout);
  52. 	int t;cin>>t;
  53. 	while(t--){
  54. 		TC();
  55. 	}
  56.  
  57. }
Success #stdin #stdout 0.01s 5344KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/RdQ6v9
language:
C++14 (clang 8.0)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!