algorithm_study/DishonestSellers.cpp at master · wonjerry/algorithm_study · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct Item {
    int now, next, diff;
};

void merge(int start, int end, vector<Item> &items) {
    int mid = (start + end) / 2;
    int l = start;
    int r = mid + 1;
    int index = 0;
    vector<Item> result(end - start + 1);

    while(l <= mid && r <= end) {
        if(items[l].diff < items[r].diff) {
            result[index++] = items[l++];
        }else if(items[l].diff > items[r].diff) {
            result[index++] = items[r++];
        }else {
            if(items[l].now < items[r].now) {
                result[index++] = items[l++];
            }else if(items[l].now > items[r].now) {
                result[index++] = items[r++];
            }else {
                result[index++] = items[l++];
                result[index++] = items[r++];
            }
        }
    }

    while(l <= mid) result[index++] = items[l++];
    while(r <= end) result[index++] = items[r++];

    for(int i = start; i <= end; i++) {
        items[i] = result[i - start];
    }
}

void _sort(int start, int end, vector<Item> &items) {

    if(start == end) {
        return;
    }

    int mid = (start + end) / 2;

    _sort(start, mid, items);
    _sort(mid + 1, end, items);
    merge(start, end, items);
}

int main() {
    int n, k;
    scanf("%d %d", &n, &k);
    vector<Item> items(n);

    for(int i = 0; i < n; i++) {
        scanf("%d", &items[i].now);
    }

    for(int i = 0; i < n; i++) {
        scanf("%d", &items[i].next);
    }

    for(int i = 0; i < n; i++) {
        items[i].diff = items[i].now - items[i].next;
    }

    _sort(0, n - 1, items);

    int sum = 0;
    for(int i = 0; i < n; i++) {
        if(items[i].diff <= 0) {
            sum += items[i].now;
            k--;
        }else if(items[i].diff > 0 && k > 0) {
            sum += items[i].now;
            k--;
        }else {
            sum += min(items[i].now, items[i].next);
        }
    }

    printf("%d\n", sum);
    return 0;
}