Submission #447749

#TimeUsernameProblemLanguageResultExecution timeMemory
447749blue운세 보기 2 (JOI14_fortune_telling2)C++17
4 / 100
3049 ms460 KiB
#include <iostream> using namespace std; int main() { int N, K; cin >> N >> K; int A[N+1], B[N+1]; for(int i = 1; i <= N; i++) cin >> A[i] >> B[i]; for(int j = 1; j <= K; j++) { int T; cin >> T; for(int i = 1; i <= N; i++) { if(A[i] <= T) swap(A[i], B[i]); } } long long res = 0; for(int i = 1; i <= N; i++) res += A[i]; cout << res << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...