| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 9363 | eternalklaus | Uniting (kriii2_U) | C++98 | 0 ms | 1868 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int arr[100000];
int sort[100000];
int main()
{
	int n,i,j,index;
	int tmp;
	int sum=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		index=0;
		scanf("%d",&tmp);
		while(tmp>arr[index]&&index<i)
			index++;
		//index++자리에 인서트.
		for(j=i-1;j>=index;j--)
			arr[j+1]=arr[j];
		arr[index]=tmp;
	}
	for(i=0;i<n-1;i++)
	{
		sum+=arr[i]*arr[i+1];
		arr[i+1]=arr[i]+arr[i+1];
	}
	printf("%d",sum);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
