| 23435 | 2026-01-22 20:32:36 | algopro | Gyorsolvasó-verseny | cpp17 | Accepted 100/100 | 39ms | 788 KiB |
// UUID: 2a82fb16-79ce-49a7-a07b-4678bcd64bd2
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < a.size();i++){
cin >> a[i];
}
int mini = a[0];
for (int i = 0; i < n; i++){
if (a[i] < mini){
mini = a[i];
}
}
cout << mini << "\n";
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 500 KiB | ||||
| subtask2 | 10/10 | ||||||
| 3 | Accepted | 1ms | 384 KiB | ||||
| 4 | Accepted | 1ms | 396 KiB | ||||
| 5 | Accepted | 1ms | 316 KiB | ||||
| 6 | Accepted | 1ms | 316 KiB | ||||
| 7 | Accepted | 1ms | 316 KiB | ||||
| 8 | Accepted | 1ms | 316 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| 10 | Accepted | 1ms | 316 KiB | ||||
| 11 | Accepted | 1ms | 500 KiB | ||||
| 12 | Accepted | 1ms | 316 KiB | ||||
| subtask3 | 40/40 | ||||||
| 13 | Accepted | 1ms | 316 KiB | ||||
| 14 | Accepted | 1ms | 316 KiB | ||||
| 15 | Accepted | 1ms | 316 KiB | ||||
| 16 | Accepted | 1ms | 316 KiB | ||||
| 17 | Accepted | 1ms | 316 KiB | ||||
| 18 | Accepted | 1ms | 316 KiB | ||||
| 19 | Accepted | 1ms | 316 KiB | ||||
| 20 | Accepted | 1ms | 508 KiB | ||||
| 21 | Accepted | 1ms | 316 KiB | ||||
| subtask4 | 50/50 | ||||||
| 22 | Accepted | 1ms | 316 KiB | ||||
| 23 | Accepted | 2ms | 316 KiB | ||||
| 24 | Accepted | 14ms | 564 KiB | ||||
| 25 | Accepted | 34ms | 564 KiB | ||||
| 26 | Accepted | 17ms | 788 KiB | ||||
| 27 | Accepted | 35ms | 564 KiB | ||||
| 28 | Accepted | 30ms | 564 KiB | ||||
| 29 | Accepted | 6ms | 452 KiB | ||||
| 30 | Accepted | 39ms | 564 KiB | ||||
| 31 | Accepted | 37ms | 564 KiB | ||||