Submission #997828
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <climits> #include <ctime> #include <cassert> using namespace std; #define rep(i,a,n) for(int i=a; i<n; i++) #define repq(i,a,n) for(int i=a; i<=n; i++) #define repr(i,a,n) for(int i=a; i>=n; i--) #define pb(a) push_back(a) #define fr first #define sc second #define INF 2000000000 #define int long long int #define X real() #define Y imag() #define EPS (1e-10) #define EQ(a,b) (abs((a) - (b)) < EPS) #define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) ) #define LE(n, m) ((n) < (m) + EPS) #define LEQ(n, m) ((n) <= (m) + EPS) #define GE(n, m) ((n) + EPS > (m)) #define GEQ(n, m) ((n) + EPS >= (m)) typedef vector<int> VI; typedef vector<VI> MAT; typedef pair<int, int> pii; typedef long long ll; typedef complex<double> P; typedef pair<P, P> L; typedef pair<P, double> C; int dy[]={0, 0, 1, -1}; int dx[]={1, -1, 0, 0}; int const MOD = 1000000007; namespace std { bool operator<(const P& a, const P& b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; } } signed main() { int n, m, k; cin >> n >> m >> k; int a[100010]; rep(i,0,n) cin >> a[i]; sort(a, a+n); int ans = 0; rep(i,0,k) { ans += (i+1) * a[n-1-i]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1594 Byte |
Status | WA |
Exec Time | 76 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 200 | 0 / 300 | 0 / 100 | ||||||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | WA | 2 ms | 256 KB |
sample_2.txt | AC | 3 ms | 256 KB |
sample_3.txt | WA | 2 ms | 256 KB |
subtask_1_1.txt | WA | 3 ms | 256 KB |
subtask_1_2.txt | WA | 8 ms | 384 KB |
subtask_1_3.txt | WA | 73 ms | 1024 KB |
subtask_1_4.txt | WA | 6 ms | 256 KB |
subtask_1_5.txt | WA | 66 ms | 1024 KB |
subtask_1_6.txt | WA | 3 ms | 256 KB |
subtask_1_7.txt | WA | 74 ms | 1024 KB |
subtask_1_8.txt | WA | 74 ms | 1024 KB |
subtask_1_9.txt | WA | 3 ms | 256 KB |
subtask_2_1.txt | WA | 3 ms | 256 KB |
subtask_2_2.txt | WA | 3 ms | 256 KB |
subtask_2_3.txt | WA | 3 ms | 256 KB |
subtask_2_4.txt | WA | 3 ms | 256 KB |
subtask_2_5.txt | WA | 3 ms | 256 KB |
subtask_2_6.txt | WA | 3 ms | 256 KB |
subtask_2_7.txt | WA | 3 ms | 256 KB |
subtask_2_8.txt | WA | 3 ms | 256 KB |
subtask_2_9.txt | WA | 3 ms | 256 KB |
subtask_3_1.txt | WA | 74 ms | 1024 KB |
subtask_3_2.txt | WA | 74 ms | 1024 KB |
subtask_3_3.txt | WA | 74 ms | 1024 KB |
subtask_3_4.txt | WA | 59 ms | 896 KB |
subtask_3_5.txt | WA | 6 ms | 256 KB |
subtask_3_6.txt | WA | 74 ms | 1024 KB |
subtask_3_7.txt | WA | 74 ms | 1024 KB |
subtask_3_8.txt | WA | 8 ms | 384 KB |
subtask_3_9.txt | WA | 66 ms | 1024 KB |
subtask_4_1.txt | WA | 69 ms | 1024 KB |
subtask_4_10.txt | WA | 62 ms | 1024 KB |
subtask_4_11.txt | WA | 74 ms | 1024 KB |
subtask_4_12.txt | WA | 74 ms | 1024 KB |
subtask_4_13.txt | WA | 74 ms | 1152 KB |
subtask_4_2.txt | WA | 76 ms | 1024 KB |
subtask_4_3.txt | WA | 73 ms | 1024 KB |
subtask_4_4.txt | WA | 74 ms | 1024 KB |
subtask_4_5.txt | WA | 74 ms | 1024 KB |
subtask_4_6.txt | WA | 73 ms | 1024 KB |
subtask_4_7.txt | WA | 74 ms | 1024 KB |
subtask_4_8.txt | WA | 73 ms | 1024 KB |
subtask_4_9.txt | WA | 73 ms | 1024 KB |