【趣学算法】贪心算法、海盗古董装船问题

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100;
double w[N];
int main()
{
    double c;
    int n;
    cout << "请输入载重量C及古董个数:" << endl;
    cin >> c >> n;
    cout << "请输入每个古董的重量，用空格分开:" << endl;
    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }
    sort(w, w + n);
    double tmp = 0.0;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        tmp += w[i];
        if (tmp <= c) {
            ans ++;
        } else {
            break;
        }
    }
    cout << "能装入的古董最大数为Ans=";
    cout << ans << endl;
    return 0;
}

#include<cstdio>
#include<iostream>
#include<algorithm>
int main(){
	int a[10] = {3,2,6,8,12,89,56,32,99,78},i;
	for(i=0;i<10;i++){
		cout<<a[i]<<" ";
		cout<<endl;
	}
		sort(a,a+10);
		for(i = 0;i<10;i++){
		cout<<a[i]<<" ";
}
	return 0;
}