제출 #441463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441463		elazarkoren	Exam (eJOI20_exam)	C++17	0 / 100	3 ms	332 KiB

exam

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#define x first
#define y second
//#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 1e5 + 1;

int a[MAX_N];

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    int b;
    cin >> b;
    bool good = false;
    int count = 0;
    for (int i = 0; i < n; i++) {
        count += a[i] <= b;
        good = good || a[i] == b;
    }
    cout << (good ? count : 0);
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22