Submission #73184480

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a)  (a).begin(),(a).end()

using P=pair<ll,ll>;
using T=tuple<ll,ll,ll>;

#include <atcoder/all> 
using namespace atcoder;
// using mint=modint998244353;
// using mint=modint1000000007;
// int op(int a,int b){return (a+b);}
// int e(){return 0;}

int main() {
  ll n,m,k;cin>>n>>m>>k;
  vector<ll> a(n);
  rep(i,n)cin>>a[i];

  set<int> b;
  rep(i,m){
    int x;cin>>x;
    x--;
    b.insert(x);
  }

  ll ans=0;
  ll sum=0;

  rep(i,n){
    if(b.count(i) and a[i]<k){
      ans++;
      sum+=a[i];
    }
  }

  cout<<ans<<" "<<sum<<endl;
}

Submission Info

Judge Result