1 solutions
-
0
C :
int main(int argc, char* argv[]) { int num[10],i,j,tem; for(i=0;i<10;i++) scanf("%d",&num[i]); for(i=0;i<9;i++) for(j=i+1;j<10;j++) { if(num[i]>num[j]) { tem=num[i]; num[i]=num[j]; num[j]=tem; } } for(i=0;i<9;i++) printf("%d ",num[i]); printf("%d\n",num[i]); return 0; }C++ :
#include<stdio.h> #include<algorithm> using namespace std; int main() { int i,a[10]; for(i=0;i<10;i++) scanf("%d",&a[i]); sort(a,a+10); printf("%d",a[0]); for(i=1;i<10;i++) printf(" %d",a[i]); printf("\n"); return 0; }
- 1
Information
- ID
- 18134
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By