AcWing 4786. 闯关
原题链接
中等
作者:
Present.
,
2022-12-25 16:30:39
,
所有人可见
,
阅读 132
#include <iostream>
#include <algorithm>
using namespace std;
int n,m;
int a[110],b[110];
vector<int> v;
int main()
{
cin >> n >> m;
long long isum = 0;
for(int i = 1;i <= n;i ++)
{
cin >> a[i];
isum += a[i];
}
for(int i = 1;i <= m;i ++)
{
cin >> b[i];
v.push_back({a[b[i]]});
isum -= a[b[i]];
}
//cout << isum << endl;
sort(v.begin(),v.end());
for(int i = v.size() - 1;i >= 0;i --)
{
if(isum < v[i])
{
isum += v[i];
}
else
{
isum += isum;
}
}
cout << isum << endl;
return 0;
}