This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maks = 1e9 + 7;
int main(){
int n, p, q, ans;
cin >> n >> p >> q;
long long tol[n];
for(int i = 0; i < n; i++){
cin >> tol[i];
}sort(tol, tol + n);
ans = tol[n - 1] - tol[0] - n + 1;
for(int i = 1; i < maks ; i++){
if((p * i) + (q * 2 * i) >= ans){
cout << i << endl;
break;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |