分发饼干

`#include

include

using namespace std;
int main() {
int g[30] = {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};
int s[20] = {15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34};
int sum = 0;
int n=0;
int length = sizeof(g) / sizeof(g[0]);
int length1 = sizeof(s) / sizeof(s[0]);
for (int i = 0; i <= length; i++) {
for (int j = i + 1; j < length; j++) {
if(g[i]>g[j]){
swap(g[j], g[i]);
}
}
}
for (int i = 0; i <= length1; i++) {
for (int j = i + 1; j < length1; j++) {
if(s[i]>s[j]){
swap(s[j], s[i]);
}
}
}
for (int i = 0; i < length; i++) {
for (int j = n; j < length1; j++) {
if (g[length - 1 - i] <= s[length1 - 1 - j]) {
sum++;
n++;
}
}
}
cout << sum << endl;
}
`