# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
7849 |
2014-08-20T05:09:25 Z |
ainu7 |
카드 (GA8_card) |
C++ |
|
0 ms |
1676 KB |
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> A(n);
for (int i=0; i<n; i++) cin >> A[i];
sort(A.begin(), A.end());
int sum = 0;
for (int i=0; i<n-1; i++) sum += A[i];
cout << sum << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Correct |
0 ms |
1676 KB |
Output is correct |
3 |
Correct |
0 ms |
1676 KB |
Output is correct |
4 |
Correct |
0 ms |
1676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Correct |
0 ms |
1676 KB |
Output is correct |
3 |
Correct |
0 ms |
1676 KB |
Output is correct |
4 |
Correct |
0 ms |
1676 KB |
Output is correct |
5 |
Correct |
0 ms |
1676 KB |
Output is correct |
6 |
Correct |
0 ms |
1676 KB |
Output is correct |
7 |
Correct |
0 ms |
1676 KB |
Output is correct |
8 |
Correct |
0 ms |
1676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Correct |
0 ms |
1676 KB |
Output is correct |
3 |
Correct |
0 ms |
1676 KB |
Output is correct |
4 |
Correct |
0 ms |
1676 KB |
Output is correct |
5 |
Correct |
0 ms |
1676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Correct |
0 ms |
1676 KB |
Output is correct |
3 |
Correct |
0 ms |
1676 KB |
Output is correct |
4 |
Correct |
0 ms |
1676 KB |
Output is correct |
5 |
Correct |
0 ms |
1676 KB |
Output is correct |
6 |
Correct |
0 ms |
1676 KB |
Output is correct |
7 |
Correct |
0 ms |
1676 KB |
Output is correct |
8 |
Correct |
0 ms |
1676 KB |
Output is correct |
9 |
Correct |
0 ms |
1676 KB |
Output is correct |
10 |
Correct |
0 ms |
1676 KB |
Output is correct |
11 |
Correct |
0 ms |
1676 KB |
Output is correct |
12 |
Correct |
0 ms |
1676 KB |
Output is correct |
13 |
Correct |
0 ms |
1676 KB |
Output is correct |
14 |
Correct |
0 ms |
1676 KB |
Output is correct |
15 |
Correct |
0 ms |
1676 KB |
Output is correct |
16 |
Correct |
0 ms |
1676 KB |
Output is correct |
17 |
Correct |
0 ms |
1676 KB |
Output is correct |
18 |
Correct |
0 ms |
1676 KB |
Output is correct |
19 |
Correct |
0 ms |
1676 KB |
Output is correct |
20 |
Correct |
0 ms |
1676 KB |
Output is correct |
21 |
Correct |
0 ms |
1676 KB |
Output is correct |
22 |
Correct |
0 ms |
1676 KB |
Output is correct |