[BOJ 13458] 시험감독

출처 : https://www.acmicpc.net/problem/13458

#include <iostream>

#include <algorithm>

#include <memory.h>

using namespace std;

#define MAX_N 1000000

long N, B, C, result;

long bang[MAX_N];

void cal()

{

for (long i = 0; i < N; i++)

{

bang[i] -= B;

long count = 0;

if (bang[i] > 0)

{

result += bang[i] / C;

if (bang[i] % C > 0) result += 1;

}

}

}

int main()

{

cin >> N; result = 0;

for (long i = 0; i < N; i++) cin >> bang[i];

cin >> B >> C;

cal();

cout << result + N;

return 0;

}