Submission #47687126
Source Code Expand
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
unsigned int n;
cin >> n;
map<unsigned int, bool> exists;
vector<unsigned int> A;
for (unsigned int i = 0; i < n; i++)
{
unsigned int a;
cin >> a;
if (!exists[a])
{
exists[a] = true;
A.push_back(a);
}
}
sort(A.rbegin(), A.rend());
cout << A[1] << endl;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Next |
| User | michimani |
| Language | C++ 20 (Clang 16.0.6) |
| Score | 200 |
| Code Size | 462 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3644 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample00.txt | AC | 1 ms | 3440 KiB |
| sample01.txt | AC | 1 ms | 3380 KiB |
| sample02.txt | AC | 1 ms | 3564 KiB |
| testcase00.txt | AC | 1 ms | 3460 KiB |
| testcase01.txt | AC | 1 ms | 3484 KiB |
| testcase02.txt | AC | 1 ms | 3412 KiB |
| testcase03.txt | AC | 1 ms | 3376 KiB |
| testcase04.txt | AC | 1 ms | 3472 KiB |
| testcase05.txt | AC | 1 ms | 3448 KiB |
| testcase06.txt | AC | 1 ms | 3492 KiB |
| testcase07.txt | AC | 1 ms | 3408 KiB |
| testcase08.txt | AC | 1 ms | 3452 KiB |
| testcase09.txt | AC | 1 ms | 3384 KiB |
| testcase10.txt | AC | 1 ms | 3516 KiB |
| testcase11.txt | AC | 1 ms | 3516 KiB |
| testcase12.txt | AC | 1 ms | 3644 KiB |
| testcase13.txt | AC | 1 ms | 3516 KiB |