PAT答案（组个最小数）

题目链接

https://www.nowcoder.com/pat/6/problem/4049

代码

#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
using namespace std;
int main() {
    vector<int> result;
    int a[10];
    int flag = 1, first = 9;
    for(int i=0; i<10; i++) {
        scanf("%d", &a[i]);
        if(a[i] > 0 && i!=0 && flag) { first = i; flag = 0; }
        while(a[i]>0) { result.push_back(i); a[i]--; }
    }
    flag = 1;
    sort(result.begin(), result.end());
    printf("%d", first);
    vector<int>::iterator iter;
    for(iter=result.begin(); iter!=result.end(); iter++) {
        if(*iter == first && flag) flag = 0;
        else printf("%d", *iter);
    }
    return 0;
}