Submission #73368032

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define eb emplace_back
#define fien for(int i=0;i<n;i++)
#define srt(v) sort(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define mnv(v) *min_element(v.begin(), v.end())
#define mxv(v) *max_element(v.begin(), v.end())
#define fi first
#define se second
#define pyes cout << "Yes\n"
#define pno cout << "No\n"
#define mpi map<int,int>
#define vp vector<pair<int,int>>

using namespace std;



void solve(){
    int n, m, d; cin>>n>>m>>d;
    vi v(n);
    for(auto &x : v) cin>>x;
    int ans = 0;
    for(auto &x : v){
        if(x <= m) continue;
        else{
            int diff = x - m;
            ans += diff/d + bool(diff % d);
        }
    }
    cout<<ans<<endl;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); 
    int t = 1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Submission Info

Judge Result