제출 #1207996

#제출 시각아이디문제언어결과실행 시간메모리
1207996PenguinsAreCuteSecurity Guard (JOI23_guard)C++17
37 / 100
250 ms2040 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m, q; cin >> n >> m >> q; int s[n], d[n]; for(int i=0;i<n;i++) cin >> s[i]; memset(d,0,sizeof(d)); for(int i=0;i<m;i++) { int a, b; cin >> a >> b; d[--a]++; d[--b]++; } long long ans = 0; for(int i=0;i<n;i++) ans += (d[i] - 1LL) * s[i]; ans += *max_element(s,s+n); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...