Submission #1608222


Source Code Expand

#include<iostream>
using namespace std;

int main(){
	int n=0;
	int a[1000];
	int i=0;
	int j=0;
	int t=0;
	for(i=0;i<1000;i++){
		a[i]=0;
	}
	cin>>n;
	for(i=0;i<n;i++){
		cin>>a[i];
	}
	for(i=0;i<n;i++){
		for(j=i;j<n;j++){
			if(a[i]>a[j]){
				t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		}
	}
	
	cout<<a[n-1]-a[0]<<endl;
} 

Submission Info

Submission Time
Task B - Traveling AtCoDeer Problem
User kugeki129
Language C++14 (GCC 5.4.1)
Score 200
Code Size 351 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 6
Set Name Test Cases
Sample s1.txt, s2.txt
All in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in1.txt AC 1 ms 256 KB
in2.txt AC 1 ms 256 KB
in3.txt AC 1 ms 256 KB
in4.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB