Task: | Driving |
Sender: | Pietari Kaskela |
Submission time: | 2016-10-04 18:04:09 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.04 s | details |
#2 | ACCEPTED | 0.04 s | details |
#3 | ACCEPTED | 0.04 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.04 s | details |
#7 | ACCEPTED | 0.04 s | details |
#8 | ACCEPTED | 0.06 s | details |
#9 | ACCEPTED | 0.04 s | details |
#10 | ACCEPTED | 0.05 s | details |
#11 | ACCEPTED | 0.05 s | details |
#12 | ACCEPTED | 0.04 s | details |
#13 | ACCEPTED | 0.04 s | details |
Code
#include <bits/stdc++.h> #define i64 long long #define u64 unsigned long long #define i32 int #define u32 unsigned int #define pii pair<int, int> #define pll pair<long long, long long> #define ld long double #define defmod 1000000007 #define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0)); using namespace std; int main(){ cin.sync_with_stdio(0); cin.tie(0); i64 n, p; cin >> n >> p; i64 a[101010]; for(int i = 0; i < n; ++i) cin >> a[i]; sort(a, a+n); i64 ma = 0; for(int i = 0; i < n; ++i){ ma = max(ma, p*(i+1)-a[i]+a[0]); } cout << ma << endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 1 1 8 2 3 6 4 7 10 9 5 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Verdict: ACCEPTED
input |
---|
10 10 1 8 2 3 6 4 7 10 9 5 |
correct output |
---|
91 |
user output |
---|
91 |
Test 3
Verdict: ACCEPTED
input |
---|
10 10 61 62 26 88 60 34 74 37 52 17 |
correct output |
---|
35 |
user output |
---|
35 |
Test 4
Verdict: ACCEPTED
input |
---|
1000 2 1361 1148 1094 556 688 414 132... |
correct output |
---|
13 |
user output |
---|
13 |
Test 5
Verdict: ACCEPTED
input |
---|
100000 1 41361 23804 58360 55511 98268 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 6
Verdict: ACCEPTED
input |
---|
100000 10 741361 507734 549062 120354 84... |
correct output |
---|
1492 |
user output |
---|
1492 |
Test 7
Verdict: ACCEPTED
input |
---|
500 1 361 117 20 304 76 399 424 480 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 8
Verdict: ACCEPTED
input |
---|
500 3 361 580 180 399 524 1219 198 8... |
correct output |
---|
25 |
user output |
---|
25 |
Test 9
Verdict: ACCEPTED
input |
---|
500 7 1861 1239 1868 1504 2196 1524 ... |
correct output |
---|
127 |
user output |
---|
127 |
Test 10
Verdict: ACCEPTED
input |
---|
10000 7 61361 41456 32788 32254 1740 5... |
correct output |
---|
330 |
user output |
---|
330 |
Test 11
Verdict: ACCEPTED
input |
---|
10000 2 1361 15228 19688 11793 17336 7... |
correct output |
---|
60 |
user output |
---|
60 |
Test 12
Verdict: ACCEPTED
input |
---|
10000 10 41361 23804 58360 55511 98268 ... |
correct output |
---|
1118 |
user output |
---|
1118 |
Test 13
Verdict: ACCEPTED
input |
---|
10000 1 1361 4517 1360 7198 1272 3059 ... |
correct output |
---|
1 |
user output |
---|
1 |