Skip to content

11317: 【原1317】barn1

题目

题目描述

author: USACO 原OJ链接:https://acm.sjtu.edu.cn/OnlineJudge-old/problem/1317

Description

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.

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.

Output Format

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

Sample Input:

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

Sample Output:

25

yyong119's solution

#include <iostream>
#include <algorithm>

using namespace std;

int cmp(int a, int b) {
    return a > b;
}

int main() {

    int stalls[201];
    int intervals[201];
    int M, S, C;
    cin >> M >> S >> C;
    int minn = 9999999;
    int maxn = 0;
    for (int i = 1; i <= C; i++) {
        cin >> stalls[i];
        maxn = max(maxn, stalls[i]);
        minn = min(minn, stalls[i]);
    }
    sort(stalls + 1, stalls + C + 1);
    for (int i = 1; i <= C; i++) intervals[i] = stalls[i + 1] - stalls[i];
    sort(intervals + 1, intervals + C, cmp);

    int result = 0;
    for (int i = 1; i <= M - 1; i++) result += intervals[i];
    int ans = maxn - minn - result + M;
    if (M >= C) ans = C;
    cout << ans << endl;
    return 0;
}