# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366658 | EJOI2019Andrew | Exam (eJOI20_exam) | C++14 | 436 ms | 235116 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<bits/stdc++.h>
using namespace std;
const long long int N = 5011;
long long int a[N],b[N];
long long int dp[N][N];
long long int mx[N][N];
vector<long long int> vv;
long long int c;
map<long long int,long long int> mt;
long long int amount[N*5];
int main()
{
long long int n;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>a[i];
vv.push_back(a[i]);
}
for(int i=1; i<=n; i++)
{
cin>>b[i];
vv.push_back(b[i]);
}
sort(vv.begin(),vv.end());
for (int i=0; i<vv.size(); i++)
{
if(mt[vv[i]]==0)
{
++c;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |