Sicily 3391 Minimal Sum (难得水题)

排序求和

#include <stdio.h>#include <iostream>#include <algorithm>using namespace std;int a[1001];bool cmp(int a, int b){if(a < b){return true;}return false;}int main(){int n;int m;int t;int i;int j;int sum;scanf("%d", &n);scanf("%d", &m);for(i = 0; i < n; i++){scanf("%d", &a[i]);}sort(a, a + n, cmp);for(i = 0; i < m; i++){sum = 0;scanf("%d", &t);for(j = 0; j < t; j++){sum += a[j];}printf("%d\n", sum);}}