算法2.2 排序算法

P1177 【模板】排序

快速排序：i指针指向数组起始位置，j指针指向数组尾部位置，取一个基准值（随便一个值，但有些值会被卡），开始选择数组的数。划分为多个细小的区域，方便处理，最后再合并。

归并排序：先将数组分治为足够小的数组，从小到大选取数放入临时的数组，再逐渐合并。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, q[N], tmp[N];

void quick_sort(int q[],int l, int r){
    if(l >= r)return;
    int x = q[l + r>> 1], i = l - 1, j = r + 1;
    while(i < j){
        do i++; while(q[i] < x);
        do j--; while(q[j] > x);
        if(i < j)swap(q[i],q[j]);
    }
    quick_sort(q, l, j);
    quick_sort(q, j + 1, r);
}

void merge_sort(int q[], int l, int r){
    if(r <= l)return;
    int mid = l + r >> 1;
    merge_sort(q, l ,mid),merge_sort(q,mid + 1,r);
    int i = l,j = mid + 1, k = 0;
    while(i <= mid && j <= r){
        if(q[i] < q[j])tmp[k ++] = q[i ++];
        else tmp[k ++] = q[j ++];
    }
    while(i <= mid)tmp[k++] = q[i++];
    while(j <= r)tmp[k++] = q[j++];
    for(int i = l,j = 0;i <= r;i ++,j ++)q[i] = tmp[j];  
}

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i ++)cin >> q[i];
    merge_sort(q,1,n);
    for(int i = 1; i <= n; i ++)cout << q[i] << ' ';
}

int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int _= 1;//cin >> _;
    while(_--)solve();
    return 0;
}

P1059 [NOIP2006 普及组] 明明的随机数

用容器set。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<int>st;
int tmp,n;

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> tmp;
        st.insert(tmp);
    }
    cout << st.size() <<'\n';
    for(auto t : st){
        cout << t <<' ';
    }
}

int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int _= 1;//cin >> _;
    while(_--)solve();
    return 0;
}

P1068 [NOIP2009 普及组] 分数线划定

排序后按题目要求模拟。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3 + 10;

int n, m, t;

struct node {
    int k, s;
} a[N]; 

bool cmp(node a, node b) {
    if(a.s == b.s) return a.k < b.k;
    else return a.s > b.s;
}

void solve() {
    cin >> n >> m;
    m = m * 3 / 2;
    for(int i = 1; i <= n; i++)
        cin >> a[i].k >> a[i].s;
    sort(a + 1, a + 1 + n, cmp);
    for(int i = 1; i <= n ; i ++){
        if(a[i].s >= a[m].s)t++;
    }
    cout << a[t].s << ' ' << t << '\n'; 
    for(int i = 1; i <= t; i++){
        cout << a[i].k << ' ' << a[i].s << '\n';
    } 
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = 1; //cin >> _;
    while(_--) solve();
    return 0;
}

P1051 [NOIP2005 提高组] 谁拿了最多奖学金

模拟。注意要按输入的次序先后排序（奖金一样多时）。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3 + 10;
ll n, m, t, sum;

struct node {
    string name;
    int es,cs,thesis;
    char west,job;
    int earn = 0;
    int id;
} a[N]; 

bool cmp(node a, node b){
    if(a.earn == b.earn)return a.id <b.id;
    else return a.earn > b.earn;
}

void solve() {
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> a[i].name >> a[i].es >> a[i].cs >>a[i].job >>a[i].west >> a[i].thesis;
        if(a[i].es > 80 && a[i].thesis >= 1)a[i].earn += 8000;
        if(a[i].es > 85 && a[i].cs > 80)a[i].earn += 4000;
        if(a[i].es > 90)a[i].earn += 2000;
        if(a[i].es > 85 && a[i].west == 'Y')a[i].earn += 1000;
        if(a[i].cs > 80 && a[i].job == 'Y')a[i].earn += 850;
        a[i].id = i;
        sum += a[i].earn;
    }
    sort(a + 1, a+ 1 + n,cmp);
    cout << a[1].name <<'\n' << a[1].earn << "\n" << sum;

}

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = 1; //cin >> _;
    while(_--) solve();
    return 0;
}

P1309 [NOIP2011 普及组] 瑞士轮

用归并排序的方式优化，复杂度O(n)，如果用快排是O(nlogn)超时。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n, r, q;
struct node{
    int s, w, id;
}a[N],w[100010],l[100010];

bool cmp(node a,node b){
    if(a.s == b.s)return a.id < b.id;
    else return a.s > b.s;
}

void merge(){
    int i = 1, j = 1,k = 1;
    while (i <= n && j <= n) {
        if(w[i].s > l[j].s){
            a[k++] = w[i++];
        }
        else if(w[i].s < l[j].s){
            a[k++] = l[j++];
        }
        else if(w[i].s == l[j].s){
            if(w[i].id < l[j].id)a[k++] = w[i++];
            else a[k++] = l[j++];
        }
    }
    
    while (i <= n) {
        a[k++] = w[i++];
    }
    while (j <= n) {
        a[k++] = l[j++];
    }
}

void solve() {
    cin >> n >> r >> q;
    for(int i = 1; i <= n * 2; i ++)cin >> a[i].s;
    for(int i = 1; i <= n * 2; i ++){
        cin >> a[i].w;
        a[i].id = i;
    }
    sort(a + 1, a + 2 * n + 1, cmp);
    for(int i = 1; i <= r; i ++){
        int h = 1,g = 1;
        for(int j = 1;j <= 2 * n; j+= 2){
            if(a[j].w >= a[j + 1].w){
                a[j].s++;
                w[h++] = a[j];
                l[g++] = a[j + 1];
            }
            else if(a[j].w < a[j + 1].w){
                a[j + 1].s++;
                w[h++] = a[j + 1];
                l[g++] = a[j];
            }
        }
        merge();
    }
    //cout << '\n';
    //for(int i = 1 ;i <= 2 * n ; i ++)cout << a[i].id << ' ' << a[i].s << '\n' ;
    cout << a[q].id;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = 1; //cin >> _;
    while(_--) solve();
    return 0;
}

P1908 逆序对

利用归并排序的特点，分而治之。每次逆序放入数据时，都要做一次统计，因为两边的数据都是升序，所以ans += mid - i + 1;

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5 + 10;

ll n, a[N],b[N],ans;

void merge_sort(ll q[], int l, int r){
    if(l >= r)return;
    int mid = l + r >> 1;
    merge_sort(q, l, mid),merge_sort(q, mid + 1, r);
    int i = l,j = mid + 1,k = 1;
    while(i <= mid && j <= r){
        if(a[i] <= a[j])b[k++] = a[i++];
        else b[k++] = a[j++],ans+= mid - i + 1;
    }
    while(i <= mid)b[k++] = a[i++];
    while(j <= r)b[k++] = a[j++];
    for(int i = l,j = 1;i <= r;j++,i++)a[i] = b[j];
}

void solve() {
    cin >> n;
    for(int i = 1; i <= n; i++)cin >> a[i];
    merge_sort(a, 1, n);
    cout << ans;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = 1; //cin >> _;
    while(_--) solve();
    return 0;
}