Submission #5893970
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; using ll = long long; constexpr int INF = 1e9; constexpr int MOD = 1e9 + 7; template<class T> inline void chmax(T &a,T b){if(a<b)a=b;} template<class T> inline void chmin(T &a,T b){if(a>b)a=b;} int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; vector<int> A(N); for(int i=0;i<N;++i) cin >> A[i]; sort(A.rbegin(),A.rend()); int ans = 0; for(int i=0;i<N;i += 2) ans += A[i]; cout << ans << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - カードと兄妹 |
User | tonyu0 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 571 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt |
All | 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
01-11.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |