49 修理牛棚 DHU

#include<bits/stdc++.h>
using namespace std;

int a[1300],b[1300];
int main()
{
    int m,c, a[100],b[100];
    int s = 0;
    while (cin>>m>>c) {
    	for (int i = 1; i <= c; i++) {
    		cin>>a[i];
		}
		sort(a + 1, a + c + 1);
		for (int i = 1; i < c; i++) {
			b[i] = a[i + 1] - a[i];
		}
		sort (b + 1, b + c);
		for (int i = 1; i <= c - m; i++) {
			s += b[i];
		}
		if (m > c) {
			m = c;
		}
		cout<< s + m <<endl;
	}
    return 0;
}