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 <bits/stdc++.h>
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;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |