# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129534 | Meloric | Sorting (IOI15_sorting) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int l = 0; int r = ind[ia].size();
while(r-l>1){
int m = (r+l)/2;
if(i+1<ind[ia][m].X)r = m;
else l = m;
}