题目
思路
裸贪心,记得开long long,差点没开
code:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
inline long long read()
{
long long ret,c,f=1;
while (((c=getchar())> '9'||c< '0')&&c!='-');
if (c=='-') f=-1,ret=0;
else ret=c-'0';
while ((c=getchar())>='0'&&c<='9') ret=(ret<<1)+(ret<<3)+(c^48);
return ret*f;
}
long long n,k,tot,a[65555];
bool book[83444444];
priority_queue<long long> o;
int main()
{
n=read(),k=read()-1;
for (long long i=1;i<=n;i++)
{
long long x=read()/12+1;
if (book[x]==0) book[x]=1,a[++tot]=x;
}
a[++tot]=0;
sort(a+1,a+tot+1);
for (long long i=1;i<tot;i++)
{
long long x=a[i+1]-a[i]-1;
o.push(x);
}
long long ans=a[tot];
for (long long i=1;i<=k&&o.size();i++)
{
ans-=o.top();
o.pop();
}
ans*=12;
cout<<ans;
return 0;
}