| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 447749 | blue | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 3049 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
