Contest Setting Gym - 101982C

 https://cn.vjudge.net/problem/Gym-101982C

思路：离散化等级；dp[i][j]表示取到第i个等级，共取了j个；每个取或不取就是背包； 

#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=1e3+9;
const int M=4e5+9;
const int mod=998244353;

int a[N],b[N];
int num[N];
ll dp[N][N];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        b[i]=a[i];
    }
    sort(b,b+n);
    int len=unique(b,b+n)-b;
    for(int i=0;i<n;i++)
    {
        a[i]=lower_bound(b,b+len,a[i])-b+1;
        //cout<<a[i]<<" ";
    }

    sort(a,a+n);
    for(int i=0;i<n;i++) num[a[i]]++;

    //for(int i=0;i<=m;i++) dp[0][i]=1;
    dp[0][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int k=m;k>=0;k--)
        {
            if(k==0)
            {
                dp[i][k]=dp[i-1][k];
            }
            else
                dp[i][k]=(dp[i-1][k-1]*(ll)num[i]%mod+dp[i-1][k])%mod;

            //cout<<dp[i][k]<<" ";
        }
        //cout<<endl;
    }

    ll ans=0;
    ans=dp[n][m];
    cout<<ans<<endl;

    return 0;
}