# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
962576 |
2024-04-13T20:45:19 Z |
starchan |
Poi (IOI09_poi) |
C++17 |
|
162 ms |
8124 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define in array<int, 2>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
signed main()
{
fast();
int n, t, p;
cin >> n >> t >> p;
in a[n];
for(int i = 0; i < n; i++)
{
a[i][0] = 0;
for(int j = 0; j < t; j++)
{
int pp; cin >> pp;
a[i][0]+=pp;
}
a[i][1] = i;
}
sort(a, a+n);
for(int i = 0; i < n; i++)
{
if(a[i][1] == (p-1))
{
cout << (i+1) << " " << a[i][0] << "\n";
return 0;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
5 ms |
604 KB |
Output isn't correct |
12 |
Incorrect |
8 ms |
700 KB |
Output isn't correct |
13 |
Incorrect |
24 ms |
1580 KB |
Output isn't correct |
14 |
Incorrect |
37 ms |
2224 KB |
Output isn't correct |
15 |
Incorrect |
60 ms |
3248 KB |
Output isn't correct |
16 |
Incorrect |
64 ms |
3408 KB |
Output isn't correct |
17 |
Incorrect |
97 ms |
4916 KB |
Output isn't correct |
18 |
Incorrect |
108 ms |
5716 KB |
Output isn't correct |
19 |
Incorrect |
155 ms |
7480 KB |
Output isn't correct |
20 |
Incorrect |
162 ms |
8124 KB |
Output isn't correct |