#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<pair<int, int>> v;
vector<int> ans;
void input(){
v.resize(8);
for(int i = 0; i < 8; i++){
cin >> v[i].first;
v[i].second = i;
}
}
void solve(){
sort(v.begin(), v.end());
int ret = 0;
for(int i = 0; i < 8; i++){
if(i >= 3){
ret += v[i].first;
ans.push_back(v[i].second + 1);
}
}
cout << ret << "\n";
sort(ans.begin(), ans.end());
for(int i = 0; i < 5; i++){
cout << ans[i] << " ";
}
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
input();
solve();
return 0;
}
인덱스 기록해, 정렬하는 문제
