| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
是什么地方出现问题,请各位指点一下//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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator