https://codeforc.es/contest/1065/problem/C
题意:n栋楼,高h[i],从上往下每次可以水平最多砍k个格;问最少要砍几次使得它们等高;
思路:处理出每层格子数,从上往下贪心取;
#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&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-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e6+9;
const int mod=998244353;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
ll num[maxn];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n,k;
cin>>n>>k;
int Min=INF;
int Max=0;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
Min=min(Min,x);
Max=max(Max,x);
num[x]++;
}
for(int i=Max;i>=0;i--)
{
num[i]=num[i+1]+num[i];
}
ll tot=0;
ll ans=0;
for(int i=Max;i>=0;i--)
{
if(num[i]==n) break;
if(tot+num[i]<=k)
{
tot+=num[i];
}
else
{
tot=0;
ans++;
i++;
}
}
if(tot>0) ans++;
cout<<ans<<endl;
return 0;
}