-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1105A.cpp
74 lines (68 loc) · 1.68 KB
/
1105A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi(n) for(ll i=0; i<n; i++)
#define fj(n) for(ll j=0; j<n; j++)
#define rfi(n) for(ll i = n-1; i >=0; --i)
#define fa(n) for(auto i:n)
#define fa2(n) for(auto i:n) cout<<i<<' ';
#define llt ll t; cin>>t; while(t--)
#define lln ll n; cin>>n;
#define llnm ll n,m; cin>>n>>m;
#define llx ll x; cin>>x;
#define llxy ll x,y; cin>>x>>y;
#define llab ll a,b; cin>>a>>b;
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define pb push_back
#define mp make_pair
#define pbx ll xx; cin>> xx; v.pb(xx);
#define pbs string xx; cin>> xx; v.pb(xx);
#define all(x) x.begin(), x.end()
#define srt(x) sort(all(x))
#define rsrt(x) sort(all(x),greater<ll>())
#define veccin(n) vll v(n); fi(n) cin>>v[i];
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
#define endl "\n"
#define nl <<endl
#define sp <<' '
#define sps <<' '<<
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define C(x) cout<< x <<endl;
#define F i.first
#define S i.second
// ll arr[100000000]={0};
using namespace std;
int main(){
lln;
// vll v(n);
// ll sum=0;
// fi(n){
// cin>>v[i];
// sum+=v[i];
// }
// ll avg = ceil((double)sum/v.size());
// sum=0;
// fi(n){
// sum+= min(min(abs(v[i]-avg),abs(v[i]-avg-1)),abs(v[i]-avg+1));
// }
// cout<<avg sps sum;
map<ll, ll > m;
vll v(n);
ll mx=0,temp,sum=0;
fi(n){
cin>>v[i];
m[v[i]]++;
if(m[v[i]]>=mx){
mx=m[v[i]];
temp=v[i];
}
}
fi(n){
sum+= min(min(abs(v[i]-temp),abs(v[i]-temp-1)),abs(v[i]-temp+1));
}
cout<<temp sps sum;
}