Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

是什么地方出现问题,请各位指点一下

Posted by liuxiao2009 at 2012-04-11 20:45:08 and last updated at 2012-04-11 20:49:11
//poj3253
#include<stdio.h>
#include<stdlib.h>
int main()
{
	int i,j,N,m;
	int sum1,sum;
	int *a;
	scanf("%d",&N);
	a=(int*)malloc(N*sizeof(int));
	for(i=0;i<N;i++)
	{
		scanf("%d",&a[i]);
	}
	//冒泡排序
	for(i=0;i<N-1;i++)
	{
		for(j=i+1;j<N;j++)
		{
			if(a[i]>a[j])
			{
				m=a[j];
				a[j]=a[i];
				a[i]=m;
			}
		}
	}
	//求和
	sum1=a[0];
	sum=0;
	for(i=1;i<N;i++)
	{
		sum1=sum1+a[i];
		sum=sum+sum1;
	}
	printf("%d\n",sum);
	return 0;
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator