#include <stdio.h>
#include <algorithm>
using namespace std;
struct ab
{
int m;
}data[100000];
int aa(ab c,ab d)
{
if(c.m<d.m) return 1;
return 0;
}
int main()
{
int i,j,n,tot=0;
scanf("%d ",&n);
for(i=1;i<=n;i++)
{
scanf("%d ",&data[i].m);
}
std::sort(data+1,data+1+n,aa);
for(i=1;i<n;i++)
{
tot+=data[i].m;
}
printf("%d",tot);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
6 |
Correct |
0 ms |
1476 KB |
Output is correct |
7 |
Correct |
0 ms |
1476 KB |
Output is correct |
8 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
6 |
Correct |
0 ms |
1476 KB |
Output is correct |
7 |
Correct |
0 ms |
1476 KB |
Output is correct |
8 |
Correct |
0 ms |
1476 KB |
Output is correct |
9 |
Correct |
0 ms |
1476 KB |
Output is correct |
10 |
Correct |
0 ms |
1476 KB |
Output is correct |
11 |
Correct |
0 ms |
1476 KB |
Output is correct |
12 |
Correct |
0 ms |
1476 KB |
Output is correct |
13 |
Correct |
0 ms |
1476 KB |
Output is correct |
14 |
Correct |
0 ms |
1476 KB |
Output is correct |
15 |
Correct |
0 ms |
1476 KB |
Output is correct |
16 |
Correct |
0 ms |
1476 KB |
Output is correct |
17 |
Correct |
0 ms |
1476 KB |
Output is correct |
18 |
Correct |
0 ms |
1476 KB |
Output is correct |
19 |
Correct |
0 ms |
1476 KB |
Output is correct |
20 |
Correct |
0 ms |
1476 KB |
Output is correct |
21 |
Correct |
0 ms |
1476 KB |
Output is correct |
22 |
Correct |
0 ms |
1476 KB |
Output is correct |