oj.uz

Submission #899398

# Submission time Handle Problem Language Result Execution time Memory
899398 2024-01-06T02:54:38 Z Muhammad_Aneeq Sails (IOI07_sails) C++17
40 / 100
 1000 ms 3148 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
void solve()
{
	int n;
	cin>>n;
	pair<int,int>a[n];
	for (auto &i:a)
		cin>>i.first>>i.second;
	sort(a,a+n);
	priority_queue<int,vector<int>,greater<int>>pq;
	long long ans=0;
	for (auto [h,k]:a)
	{
		while (pq.size()<h)
			pq.push(0);
		vector<int>z;
		while (k--)
		{
			z.push_back(pq.top());
			pq.pop();
		}
		for (auto i:z)
		{
			ans+=i;
			pq.push(i+1);
		}
	}
	cout<<ans<<endl;
}
int main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Compilation message

sails.cpp: In function 'void solve()':
sails.cpp:24:19: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'std::tuple_element<0, std::pair<int, int> >::type' {aka 'int'} [-Wsign-compare]
   24 |   while (pq.size()<h)
      |          ~~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 348 KB Output is correct
2 Correct 156 ms 1036 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 736 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 1140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1018 ms 1704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 3148 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 2388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 2740 KB Time limit exceeded
2 Halted 0 ms 0 KB -