알고리즘문제들/codeground
스타벅스
Beabletoet
2017. 6. 28. 21:04
#include <iostream>using namespace std;char Answer;int main(int argc, char** argv){int T, test_case, k, n, m, ns[30], ms[20];cin >> T;for (test_case = 0; test_case < T; test_case++){Answer = 0;cin >> n >> m >> k;for (int i = 0; i < n; ++i)cin >> ns[i];for (int i = 0; i < m; ++i)cin >> ms[i];for (int i = 0; i < n; ++i)k -= ms[ns[i] - 1];Answer = (k < 0) ? 'N' : 'Y';cout << "Case #" << test_case + 1 << endl;cout << Answer << endl;}return 0;}