USACO----Barn Repair

It was a dark and stormy night that ripped the roof and gates off the stalls that hold Farmer John's cows. Happily, many of the cows were on vacation, so the barn was not completely full.

The cows spend the night in stalls that are arranged adjacent to each other in a long line. Some stalls have cows in them; some do not. All stalls are the same width.

Farmer John must quickly erect new boards in front of the stalls, since the doors were lost. His new lumber supplier will supply him boards of any length he wishes, but the supplier can only deliver a small number of total boards. Farmer John wishes to minimize the total length of the boards he must purchase.

Given M (1 <= M <= 50), the maximum number of boards that can be purchased; S (1 <= S <= 200), the total number of stalls; C (1 <= C <= S) the number of cows in the stalls, and the C occupied stall numbers (1 <= stall_number <= S), calculate the minimum number of stalls that must be blocked in order to block all the stalls that have cows in them.

Print your answer as the total number of stalls blocked.

PROGRAM NAME: barn1

INPUT FORMAT

Line 1:	M, S, and C (space separated)
Lines 2-C+1:	Each line contains one integer, the number of an occupied stall.

SAMPLE INPUT (file barn1.in)

4 50 18
3
4
6
8
14
15
16
17
21
25
26
27
30
31
40
41
42
43

OUTPUT FORMAT

A single line with one integer that represents the total number of stalls blocked.

SAMPLE OUTPUT (file barn1.out)

25

/*
ID: 76875131
PROG: barn1
LANG: C++11
*/

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
 {
    ofstream fout ("barn1.out");
    ifstream fin ("barn1.in");

    int m, s, c;
    fin>>m>>s>>c;

    vector<int> vecTotal(c);
    for(int i = 0; i != c; ++i)
      fin>>vecTotal[i];
    sort(vecTotal.begin(), vecTotal.end());

    //先统计有多少不连续的牛棚，每个之间差多少
    int pre_num = vecTotal[0];
    vector<int> iVec;
    for(int i = 1; i != c; ++i)
    {
       if(pre_num + 1 != vecTotal[i])
          iVec.push_back(vecTotal[i] - pre_num - 1);
       pre_num = vecTotal[i];
    }

    int n = m - 1;
    int total_num = 0;
    if(iVec.size() <= n)
      fout<<c<<endl ;    //如果木板数量大于或者等于不连续的牛棚块，那只盖有牛的牛棚就行了，没牛的就不用管了
    else
    {
       //不然就假设我们用一块大木板把牛棚从头到尾盖上，然后敲掉没牛的部分，直到木板数量到了指定的数目，自然要从多向少了敲
       //就相当于把不连续块中数目多的部分删除掉，最后遮挡的就是有牛的和牛之间相隔较少的部分
       nth_element(iVec.begin(), iVec.end() - n, iVec.end());
       fout<<c + accumulate(iVec.begin(), iVec.end() - n, 0)<<endl;
    }

    fin.close();
    fout.close();
    return 0;
}