Submission #7771123


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/

int N, K, H[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> K;
    rep(i, 0, N) cin >> H[i];

    int ans = 0;
    rep(i, 0, N) if (K <= H[i]) ans++;
    cout << ans << endl;
}






Submission Info

Submission Time
Task B - Roller Coaster
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1506 Byte
Status AC
Exec Time 8 ms
Memory 640 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 16
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-small-01.txt, 01-small-02.txt, 01-small-03.txt, 01-small-04.txt, 01-small-05.txt, 03-near-01.txt, 03-near-02.txt, 03-near-03.txt, 04-narrow-01.txt, 04-narrow-02.txt, 04-narrow-03.txt, 05-max-01.txt, 05-max-02.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 256 KiB
00-sample-02.txt AC 1 ms 256 KiB
00-sample-03.txt AC 1 ms 256 KiB
01-small-01.txt AC 1 ms 256 KiB
01-small-02.txt AC 1 ms 256 KiB
01-small-03.txt AC 1 ms 256 KiB
01-small-04.txt AC 1 ms 256 KiB
01-small-05.txt AC 1 ms 256 KiB
03-near-01.txt AC 6 ms 512 KiB
03-near-02.txt AC 7 ms 640 KiB
03-near-03.txt AC 6 ms 512 KiB
04-narrow-01.txt AC 5 ms 512 KiB
04-narrow-02.txt AC 8 ms 640 KiB
04-narrow-03.txt AC 6 ms 640 KiB
05-max-01.txt AC 8 ms 640 KiB
05-max-02.txt AC 8 ms 640 KiB