stl 初步的使用

1.sort 和  lower_bound

例如     marble      https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1415

 #include <stdio.h>
 #include <algorithm>
 const  int  maxn = ;
 using namespace std;
 int main()
 {
     //freopen("in","r",stdin);
     //freopen("out","w",stdout);
     int n, x,j, Q, i, m[maxn],kase=;
     while (scanf("%d%d", &n, &Q) ==  && n)
     {
         for (i = ; i < n; i++)
             scanf("%d", &m[i]);
         sort(m, m + n);
         printf("CASE# %d:\n",++kase);
         while (Q--)
         {
             scanf("%d", &x);
             int p = lower_bound(m, m + n, x) - m;
             if (m[p] == x)
                 printf("%d found at %d\n", x, p+);
             else
                 printf("%d not found\n", x);
         }
     }
     return ;
 }