fork download
copy 
  1. #include<iostream>
  2. #include<cmath>
  3. using namespace std;
  4. int _min(int a[],int n)
  5. {
  6. 	int temp;
  7. 	for(int i=0;i<n-1;i++)
  8. 	{ 
  9. 		if(a[i]<a[i+1])
  10. 		{	temp=a[i];		
  11. 			a[i]=a[i+1];		
  12. 			a[i+1]=temp;
  13. 		}				
  14. 	}
  15.  
  16. 	return a[n-1];
  17. }
  18. int _max(int a[],int n)
  19. {
  20. 	int temp;
  21. 	for(int i=0;i<n-1;i++)
  22. 	{ 
  23. 		if(a[i]>a[i+1])
  24. 		{	temp=a[i];		
  25. 			a[i]=a[i+1];		
  26. 			a[i+1]=temp;
  27. 		}			
  28. 	}
  29.  
  30. 	return a[n-1];
  31. }
  32.  
  33. int main()
  34. {
  35. 	int n,min=0,max=0,p;
  36. 	int sum;
  37. 	cout<<"请输入n值"<<endl;
  38. 	cin>>n;
  39. 	int *a=new int(n);
  40. 	cout<<"请依次输入朋友的坐标"<<endl;
  41. 	for(int i=0;i<n;i++)
  42. 	{
  43. 		cin>>a[i];
  44. 	}		
  45. 	min=_min(a,n);
  46. 	max=_max(a,n);
  47. 	int *q=new int(max-min+1);
  48. 	for(p=min;p<=max;p++)
  49. 	{	
  50. 		sum=0;
  51. 		for(int i=0;i<n;i++)
  52. 		{
  53. 			sum+=abs(p-a[i]);
  54. 		}
  55. 		q[p-min]=sum;
  56. 	}
  57. 	sum=_min(q,max-min+1);
  58. 	cout<<"sum="<<sum<<endl;
  59. }
  60.  
Success #stdin #stdout 0s 15232KB
comments (?)
stdin
copy 
4
1 2 3 4
stdout
copy 
请输入n值
请依次输入朋友的坐标
sum=4
https://ideone.com/wSLQJI
language:
C++ (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!