Submission #1452536
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <deque> #include <fstream> #include <iostream> #include <map> #include <math.h> #include <memory> #include <queue> #include <sstream> #include <stdio.h> #include <string> #include <vector> #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define POW(n) ((n) * (n)) #define ALL(a) (a).begin(), (a).end() #define dump(v) (cerr << #v << ": " << v << endl) #define cerr \ if (true) \ cerr using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<double> vd; typedef vector<string> vs; typedef vector<unsigned long long> vull; // ll n = to_T<ll>("114514") template <class T> T to_T(const string &s) { istringstream is(s); T res; is >> res; return res; } template <class T> string to_s(const T &a) { ostringstream os; os << a; return os.str(); } void solve(long long N, vector<long long> A) { sort(ALL(A)); reverse(ALL(A)); REP(i, N) { if (A[i] != A[0]) { cout << A[i] << endl; return; } } } int main() { ios::sync_with_stdio(false); long long N; cin >> N; vector<long long> A(N - 1 + 1); for (int i = 0; i <= N - 1; i++) { cin >> A[i]; } solve(N, A); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 心配性な富豪、ファミリーレストランに行く。 |
User | nosnosnos |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1424 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | random_1.txt, random_10.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt, small_5.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
random_1.txt | AC | 1 ms | 256 KB |
random_10.txt | AC | 1 ms | 256 KB |
random_2.txt | AC | 1 ms | 256 KB |
random_3.txt | AC | 1 ms | 256 KB |
random_4.txt | AC | 1 ms | 256 KB |
random_5.txt | AC | 1 ms | 256 KB |
random_6.txt | AC | 1 ms | 256 KB |
random_7.txt | AC | 1 ms | 256 KB |
random_8.txt | AC | 2 ms | 384 KB |
random_9.txt | AC | 1 ms | 256 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
small_1.txt | AC | 1 ms | 256 KB |
small_2.txt | AC | 1 ms | 256 KB |
small_3.txt | AC | 1 ms | 256 KB |
small_4.txt | AC | 1 ms | 256 KB |
small_5.txt | AC | 1 ms | 256 KB |