Submission #62036

#TimeUsernameProblemLanguageResultExecution timeMemory
62036Mahmoud_AdelFortune Telling 2 (JOI14_fortune_telling2)C++11
0 / 100
4 ms248 KiB
#include <iostream> #include <climits> using namespace std; typedef long long ll; int main() { int n, k; cin >> n >> k; int a[n], b[n]; for(int i=0; i<n; i++) cin >> a[i] >> b[i]; while(k--) { int x; cin >> x; for(int i=0; i<n; i++) if(a[i] <= x) swap(a[i], b[i]); } int sum = 0; for(int i=0; i<n; i++) sum += a[i]; cout << sum << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...