Algo lab/sorting tasks notes

Template for flipsort

#include <iostream>

using namespace std;

int x[1010];

main()
{
  int n;

  while(cin >> n) {
    for(int i=0; i<n; i++) {
      cin >> x[i];
    }

    // do bubble sort
  }
}

Sample codes

Sorting / pairs

#include <iostream>
#include <algorithm>

using namespace std;

pair<int,int> x[1000];

int main()
{
  int n;
  cin >> n;
  for(int i=0; i<n; i++) {
    cin >> x[i].first >> x[i].second;
  }

  sort(x, x+n);

  for(int i=0; i<n; i++) {
    cout << x[i].first << " " << x[i].second << endl;
  }
}