区间覆盖问题

PRoblem Description

Input

Output

Example Input

5 31 3 8 5 11
Example Output
7#include<stdio.h>void sort1(int pos[],int n){    int i,j,t;    for(i=0;i<n-1;i++)    {        for(j=0;j<n-i-1;j++)        {            if(pos[j]>pos[j+1])            {t=pos[j];pos[j]=pos[j+1];pos[j+1]=t;}        }    }}void sort2(int dis[],int c){    int i,j,t;    for(i=0;i<c-1;i++)    {        for(j=1;j<=c-i-1;j++)        {            if(dis[j]<dis[j+1])            {t=dis[j];dis[j]=dis[j+1];dis[j+1]=t;}        }    }}int main(){    int n,m,pos[222],len,dis[222],i;    while(~scanf("%d%d",&n,&m))    {        for(i=0;i<n;i++)            scanf("%d",&pos[i]);        sort1(pos,n);        for(i=1;i<=n-1;i++)        {            dis[i]=pos[i]-1-pos[i-1];        }        sort2(dis,n-1);        if(m>=n) len=n;        else        {            for(i=1;i<=m;i++)            {                if(i==1) len=pos[n-1];                else len=len-dis[i-1];            }        }        printf("%d/n",len);    }    return 0;}