Cod sursa(job #115571)
| Utilizator | Data | 16 decembrie 2007 12:59:24 | |
|---|---|---|---|
| Problema | Litere | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 2, Clasa a 9-a | Marime | 0.54 kb |
#include<stdio.h>
char v[10000];
int cauta_minim(int aa,int n){
int y=aa,j;
char min=v[aa];
for (j=aa;j<=n;++j)
if (v[j]<min){
min=v[j];
y=j;
}
return y;
}
int main(){
int n,i,s=0,x,j;
char y;
freopen("litere.in","r",stdin);
freopen("litere.out","w",stdout);
scanf("%d ",&n);
for (i=1;i<=n;++i)
scanf("%c",&v[i]);
for (i=1;i<=n;++i){
x=cauta_minim(i,n);
if (x>i){
s+=x-i;
for (j=x;j>i;--j){
y=v[j];
v[j]=v[j-1];
v[j-1]=y;
}
}
}
printf("%d",s);
return 0;
}
