Buy One Get One Free--贪心

分析：贪心，对两种稻草排序，然后，直接满足条件从大到小取

Code:

#include <cstdio>#include <cstring>#include <algorithm>using namespace std; const int maxn = 10000+5;int a[maxn], b[maxn];int n, m; int main() {    while(~scanf("%d%d", &n, &m)) {        for(int i = 0; i < n; i++)            scanf("%d", &a[i]);        for(int i = 0; i < m; i++)            scanf("%d", &b[i]);        sort(a, a+n);        sort(b, b+m);        int q = m-1;        int ans = 0;        for(int i = n-1; i >= 0; i--) {            ans++;            for(; q >= 0; q--){                if(a[i] > b[q]) {                    ans++;                    q--;                    break;                }            }        }        printf("%d\n", ans);    }    return 0;}