https://cn.vjudge.net/problem/Gym-101982J
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int N=2e6+9;
const int M=4e5+9;
ll a[109];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n,k;
cin>>n>>k;
ll sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
sum=a[n-1]*(k);
ll yu=sum%1000;
ll san=sum/1000;
if(yu) san++;
cout<<san<<endl;
return 0;
}