Submission #1608231
Source Code Expand
#include<iostream> using namespace std; int main(){ int N=0; int a[100]; int hozon=0; int i=0; int c=0; cin>>N; for(i=0;i<N;i++){ cin>>a[i]; } for(i=0;i<N;i++){ for(c=0;c<N-1;c++){ if(a[c]<a[c+1]){ hozon=a[c]; a[c]=a[c+1]; a[c+1]=hozon; } } } cout<<a[0]-a[N-1]; }
Submission Info
Submission Time | |
---|---|
Task | B - Traveling AtCoDeer Problem |
User | Gureigu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 359 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 |