Solutions/Fanta's Solution PKU 1804. Brainman. AC 지환태 2008. 10. 10. 16:14 #include <stdio.h> main() { int arr[1000]; int cnt,i,j,k,cases,n,tmp; int sorted=1; scanf("%d",&cases); for(k=1;k<=cases;k++) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&arr[i]); for(i=cnt=0; i<n-1; i++) { for(j=1; j<n; j++) { if(arr[j-1]>arr[j]) { tmp=arr[j-1]; arr[j-1]=arr[j]; arr[j]=tmp; cnt++; sorted=0; } } if(sorted) break; } printf("Scenario #%d:\n",k); printf("%d\n\n",cnt); } } <SPAN id=tx_marker_caret></SPAN> 이거덕에 if(sorted) break; <SPAN id=tx_marker_caret></SPAN> 메모리사용이 1/4로 줄어드네요