#include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <limits.h>
typedef long long ll;
using namespace std;
int n, m, t;
int main()
{
#ifdef _CONSOLE
freopen("input.txt", "r", stdin);
#endif
vector< pair<int, int > > data;
vector< pair<double, int > > ans;
pair<int, int > p;
pair<double, int> q;
ll n, total = 0;
cin >> n;
for (int i = 0; i < n; i++){
cin >> p.first;
data.push_back(p);
total += p.first;
}
for (int i = 0; i < n; i++)
cin >> data[i].second;
for (int i = 0; i < n; i++){
q.first = ((double)(total)-data[i].first) / ((double)1 / data[i].second);
q.second = i + 1;
ans.push_back(q);
}
sort(ans.begin(), ans.end());
cout << ans[0].second << " " << ans[1].second << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
2 |
Correct |
1 ms |
1720 KB |
Output is correct |
3 |
Incorrect |
1 ms |
1720 KB |
Output isn't correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
1720 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
5824 KB |
Output isn't correct |
2 |
Correct |
82 ms |
5824 KB |
Output is correct |
3 |
Incorrect |
63 ms |
5824 KB |
Output isn't correct |
4 |
Correct |
33 ms |
3776 KB |
Output is correct |
5 |
Correct |
67 ms |
5824 KB |
Output is correct |
6 |
Incorrect |
80 ms |
5824 KB |
Output isn't correct |
7 |
Incorrect |
55 ms |
3776 KB |
Output isn't correct |
8 |
Incorrect |
50 ms |
5824 KB |
Output isn't correct |
9 |
Incorrect |
31 ms |
3776 KB |
Output isn't correct |
10 |
Correct |
77 ms |
5824 KB |
Output is correct |
11 |
Correct |
83 ms |
5824 KB |
Output is correct |
12 |
Incorrect |
53 ms |
5824 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
92 ms |
5824 KB |
Output isn't correct |
2 |
Incorrect |
91 ms |
5824 KB |
Output isn't correct |
3 |
Incorrect |
95 ms |
5824 KB |
Output isn't correct |
4 |
Correct |
89 ms |
5824 KB |
Output is correct |
5 |
Correct |
62 ms |
5824 KB |
Output is correct |
6 |
Incorrect |
96 ms |
5824 KB |
Output isn't correct |
7 |
Correct |
89 ms |
5824 KB |
Output is correct |
8 |
Incorrect |
87 ms |
5824 KB |
Output isn't correct |
9 |
Incorrect |
85 ms |
5824 KB |
Output isn't correct |
10 |
Correct |
68 ms |
5824 KB |
Output is correct |
11 |
Correct |
95 ms |
5824 KB |
Output is correct |
12 |
Correct |
94 ms |
5824 KB |
Output is correct |
13 |
Correct |
76 ms |
5824 KB |
Output is correct |
14 |
Incorrect |
99 ms |
5824 KB |
Output isn't correct |
15 |
Correct |
23 ms |
3776 KB |
Output is correct |
16 |
Incorrect |
55 ms |
3776 KB |
Output isn't correct |
17 |
Correct |
88 ms |
5824 KB |
Output is correct |