infoarena

int cmp( tip a, tip b)
{
//returneaza 1 daca a trebuie sa apara inaintea lui b, 0 invers
}

....

sort(v.begin(), v.end(), cmp);

sort(v.rbegin(), v.rend());

sort(v.begin(), v.end(), greater<int>());

sort(v.begin(), v.end() );
reverse( v.begin(), v.end() );

vector <char *> v;

void citire()
{
  char s[100];
  scanf("%d",&n);
  for(int i=0; i<n; i++)
  {
    scanf("%s",&s);
    int k = strlen(s);
    if(s[k-1] == '\n')
      s[k-1] = 0;
    v.push_back(s);
    printf("%s\n",v.back());
  }
  
  for(vector <char *> :: iterator it = v.begin(); it!= v.end(); it++)
    printf("%s\n",*it);
}

5
asdaf
dsfsdfasdf
sadfsrcr
c
sdcsdf

asdaf
dsfsdfasdf
sadfsrcr
c
sdcsdf
sdcsdf
sdcsdf
sdcsdf
sdcsdf
sdcsdf

vector <char *> v; 

vector <string> v;

void citire()
{
  char s[100];
  scanf("%d",&n);
  for(int i=0; i<n; i++)
  {
    scanf("%s",&s);
    int k = strlen(s);
    if(s[k-1] == '\n')
      s[k-1] = 0;
    v.push_back(s);
    printf("%s\n",v.back().c_str());
  }
  
  for(vector <string> :: iterator it = v.begin(); it!= v.end(); it++)
    printf("%s\n",(*it).c_str());
}

int cmp(pair<int, int> a, pair<int, int > b){
	if (a.first != b.first)
		return a.first < b.first;
	return a.second < b.second;
}

sort(v.begin(), v.end(), cmp);

int cmp(pair<int, int> a, pair<int, int > b){
	if (a.first != b.first)
		return a.first < b.first;
	return a.second > b.second;
}

vector<pair<int, int> > A;
// adaugi elementele in felul urmator: daca vrei sa inserezi perechea (x, y), adaugi cu A.push_back( make_pair(x, -y) )
// apoi
sort(A.begin(), A.end());
//apoi cand accesezi elementele din vector, folosesti A[i].first si  -A[i].second pentru a obtine cele doua campuri.

int F(vector <int> p, vector <int> b)

int F ( vector<int> &p, vector<int> &b )

M[5] = M[3];

priority_queue H <int, vector<int> cmp()>

priority_queue <int> Q;

priority_queue <int, vector <int>, cmp > Q;