Submission #1796380

---

Source Code Expand

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

const int MAXN = 110;
int nums[MAXN];
vector<int> vec,vmid;
int vlen;

int main()
{
	int n,l = 1111,r = -1,mid1 = -1,mid2 = -1,mid3 = -1,mid4 = -1;
	scanf("%d",&n);
	for(int i = 0; i < n; ++i)
	{
		scanf("%d",&nums[i]);
		vec.push_back(nums[i]);
	}

	if(n&1)
	{
		mid1 = nums[n/2];
		vmid.push_back(mid1);
	}
	else
	{
		if((nums[n/2]+nums[n/2-1])&1)
		{
			mid1 = (nums[n/2]+nums[n/2-1])/2;
			mid2 = mid1+1;
			vmid.push_back(mid1);
			vmid.push_back(mid2);
		}
		else
		{
			mid1 = (nums[n/2]+nums[n/2-1])/2;
			vmid.push_back(mid1);
		}
	}
	sort(vec.begin(),vec.end());
	vec.erase(unique(vec.begin(), vec.end()), vec.end());
	vlen = vec.size();
	if(vlen&1)
	{
		mid3 = vec[vlen/2];
		vmid.push_back(mid3);
	}
	else
	{
		if((vec[vlen/2]+vec[vlen/2-1])&1)
		{
			mid3 = (vec[vlen/2]+vec[vlen/2-1])/2;
			mid4 = mid3+1;
			vmid.push_back(mid3);
			vmid.push_back(mid4);
		}
		else
		{
			mid3 = vec[vlen/2]+vec[vlen/2-1]/2;
			vmid.push_back(mid3);
		}
	}
	sort(vmid.begin(),vmid.end());
	for(auto x : vmid)
	{
		l = min(l,x);
		r = max(r,x);
	}
	int res = 999999999;
	int cost;
	for(int i = l; i <= r; ++i)
	{
		cost = 0;
		for(int j = 0; j < n; ++j)
			cost += (nums[j]-i)*(nums[j]-i);
		res = min(res,cost);
	}
	printf("%d\n",res);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:15:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&nums[i]);
                       ^

Judge Result