Submission #1692669
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <cstdio> #include <vector> #include <map> #include <set> #include <algorithm> #include <string> #include <cstdlib> #include <stack> #include <queue> #include <cmath> #define rep(i,j,k) for(int i=(int)j;i<(int)k;i++) #define repp(i,j,k) for(int i=j;i>=k;i--) #define llrep(i,j,k) for(long long int i=j;i<(long long int)k;i++) #define Sort(x) sort(x.begin(),x.end()); #define vi vector<int> #define vvi vector<vector<int>> #define ll long long int mod=1e9+7; const int INF = 100000000; using namespace std; void p(int x) { cout << x << endl; } void pp(string s) { cout << s << endl; } int main(void) { int n; cin >> n; vi v(2 * n); rep(i, 0, 2 * n) cin >> v[i]; Sort(v); int sum = 0; for(int i = 0; i < 2*n; i += 2) sum += v[i]; cout << sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - BBQ Easy |
User | gotutiyan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 897 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt |
All | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.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 |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |