Submission #7739341

---

Source Code Expand

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <tuple>
#include <bitset>
#include <memory>
#include <cmath>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#include <cfloat>






int main() {
	int n, k; std::cin >> n >> k;
	std::vector<int> heights(n); for (auto& h : heights) std::cin >> h;
	std::cout << std::count_if(heights.begin(), heights.end(), [k](const int h) {return h >= k; }) << std::endl;
}

Submission Info

Judge Result