贪心.cpp

分饼干:

    int child[4]={7,10,1,2};
    int sut[4]={5,9,3,1};
    sort(child,child+4);
    sort(sut,sut+4);
    int res=0;int j=3;
    for (int i = 3; i >= 0; --i) {//控制胃口
        while(j>=0&&sut[j]>=child[i]){//先保证非负
            res++;
            j--;
            break;//结束循环
        }
    }
    ::printf("%d",res);

---

排排不等式与等待者

    main(){
    long long n;
    scanf("%d",&n);
    long long arr[n];
    for (int i = 0; i < n; ++i) {
        ::scanf("%lld",&arr[i]);
    }
    if(n==1){
        printf("%d",arr[0]);return 0;
    }

    sort(arr,arr+n);
    long long k=n-1,res=0;
    for (int i = 0; i < n-1; ++i) {
        res+=k*arr[i];k--;
    }
    ::printf("%lld",res);

奥数罢,数据开大一点