Codeforces Round #533 (Div. 2) Solution

 

A. Salem and Sticks

签.

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 #define N 1010
 5 int n, a[N];
 6 
 7 int work(int x)
 8 {
 9     int res = 0;
10     for (int i = 1; i <= n; ++i)
11         res += max(0, abs(x - a[i]) - 1);
12     return res;
13 }
14 
15 int main()
16 {
17     while (scanf("%d", &n) != EOF)
18     {
19         for (int i = 1; i <= n; ++i) scanf("%d", a + i);
20         int Min = (int)1e9, pos = -1;
21         for (int i = 1; i <= 100; ++i) 
22         {
23             int tmp = work(i);
24             if (tmp < Min)
25             {
26                 Min = tmp;
27                 pos = i;
28             }
29         }    
30         printf("%d %d\n", pos, Min);
31     }
32     return 0;
33 }

View Code