Submission #4071634
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <string> #include <cmath> #include <map> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> plglg; typedef pair<double, ll> pdlg; typedef tuple<int, int, int> tiii; typedef tuple<ll, ll, ll> tlglglg; typedef tuple<double, double, double> tddd; static const int giga = pow(10,9); int main(void){ int n; cin >> n; vector<int> a; for(int i = 0; i < n; i++){ int temp; cin >> temp; a[i] = temp; } sort(a.begin(), a.end(), greater<int>()); for(int i = 0; i < n; i++){ if(a[i] < a[0]){ cout << a[i] << endl; return 0; } else { } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 心配性な富豪、ファミリーレストランに行く。 |
User | Dakuon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 748 Byte |
Status | RE |
Exec Time | 105 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 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 | RE | 105 ms | 256 KB |
random_10.txt | RE | 104 ms | 256 KB |
random_2.txt | RE | 104 ms | 256 KB |
random_3.txt | RE | 104 ms | 256 KB |
random_4.txt | RE | 104 ms | 256 KB |
random_5.txt | RE | 103 ms | 256 KB |
random_6.txt | RE | 103 ms | 256 KB |
random_7.txt | RE | 103 ms | 256 KB |
random_8.txt | RE | 103 ms | 256 KB |
random_9.txt | RE | 104 ms | 256 KB |
sample_1.txt | RE | 101 ms | 256 KB |
sample_2.txt | RE | 103 ms | 256 KB |
sample_3.txt | RE | 104 ms | 256 KB |
small_1.txt | RE | 103 ms | 256 KB |
small_2.txt | RE | 103 ms | 256 KB |
small_3.txt | RE | 103 ms | 256 KB |
small_4.txt | RE | 104 ms | 256 KB |
small_5.txt | RE | 101 ms | 256 KB |