barn repair

#include<fstream>
using namespace std;
int main()
{
	int i,j,k,m,s,c,start=1,minlength=0;
	int number[201],sort[200];
	ifstream fin ("barn1.in");
	ofstream fout ("barn1.out");
	fin>>m>>s>>c;
	for(i=1;i<=c;i++)
	{
		fin>>number[i];
	}
	int temp;
	for(i=1;i<=c;i++)
	{
		for(j=i+1;j<=c;j++)
		{
			if(number[i]>number[j])
			{
				temp=number[i];
				number[i]=number[j];
				number[j]=temp;
			}
		}
	}
	for(i=1;i<=c-1;i++)
	{
		sort[i]=number[i+1]-number[i];
	}
	for(i=1;i<=c-1;i++)
	{
		for(j=i+1;j<=c-1;j++)
		{
			if(sort[i]<sort[j])
			{
				temp=sort[i];
				sort[i]=sort[j];
				sort[j]=temp;
			}
		}
	}
	for(i=1;i<c;i++)
	{
		for(j=1;j<=m-1;j++)
		{
			if(sort[j]==number[i+1]-number[i])
				break;
		}
		if(j!=m)
		{
			sort[j]=200;
			minlength+=number[i]-number[start]+1;
			start=i+1;
		}
	}
	minlength+=number[c]-number[start]+1;
	fout<<minlength<<endl;
	return 0;
}